🔢 mathematics

Cyclic codes over a commutative non-unitary ring of order 4

This paper investigates cyclic codes over the commutative non-unitary ring $I_2$ of order 4 by characterizing them through residue and torsion codes, establishing connections to binary quasi-cyclic codes via Gray maps, proving that their duals remain cyclic, and classifying permutation inequivalent instances for lengths up to 7.

Original authors: Marvin Olavides, Jon-Lark Kim

Published 2026-07-15

📖 5 min read🧠 Deep dive

CC BY 4.0

Original authors: Marvin Olavides, Jon-Lark Kim

Original paper licensed under CC BY 4.0 (http://creativecommons.org/licenses/by/4.0/). ✨ This is an AI-generated explanation of the paper below. It is not written or endorsed by the authors. For technical accuracy, refer to the original paper. Read full disclaimer

Imagine you are a code detective trying to crack a secret language, but instead of working with the usual alphabet of 0s and 1s, you've stumbled into a tiny, quirky village called I2. This village has only four residents: 0, a, b, and c. They are a bit strange because they don't have a "boss" (a multiplicative identity) to tell them what to do, and they follow very specific, rigid rules for how they can mix and match.

The paper by Kim and Olavides is all about exploring cyclic codes in this village. In the world of coding, a "cyclic code" is like a dance troupe where if one dancer steps to the right, everyone else must follow, and the person at the very end wraps around to the front. It's a perfect circle of movement.

The Big Discovery: The "Twist" in the Tale

The authors found that in this village of I2, not all dance troupes are created equal. They discovered two distinct types of cyclic codes: Untwisted and Twisted.

Think of an Untwisted code like a simple, straight line of dancers. If you know who is in the front row (the "residue" code) and who is in the back row (the "torsion" code), you know exactly how the whole group moves. They are neat, predictable, and separate.

But the Twisted codes? Oh, they are the rebels! In a twisted code, the front row and the back row are tangled together. You can't just look at the front row to guess the back row; there's a secret "twist map" connecting them. The paper proves that for a code to be a true cyclic code in I2, it's not enough for the front and back rows to be perfect circles on their own. They must also agree on how to twist when they rotate. If the twist doesn't match the rotation, the dance falls apart, and it's not a cyclic code anymore.

The Magic Mirror: The Gray Map

The researchers also built a special "magic mirror" called the Gray map. When you hold a code from the I2 village up to this mirror, it doesn't just reflect; it transforms.

Before the mirror: A code of length $n$ living in the 4-element village.
After the mirror: A binary code (using only 0s and 1s) of length $2n$ .

Here is the kicker: The paper proves that when you look at this reflection, the perfect circle of the I2 code doesn't stay a simple circle. Instead, it becomes a binary quasi-cyclic code of index 2. Imagine a circle that, when you spin it, doesn't just return to the start immediately, but takes two spins to get back to the exact same pattern. The authors showed this happens every single time for these codes.

What They Ruled Out

The paper is very clear about what doesn't work. In the world of regular rings (where there is a "boss" or identity element), you can often describe a code just by looking at its parts. But in I2, the authors explicitly state that residue and torsion codes alone are insufficient. You cannot describe the structure of an I2 code just by looking at its binary shadows; you absolutely need that extra ingredient, the twist map, to understand it. Without the twist, you are missing half the story.

The Evidence: Simulations and Proofs

The authors didn't just guess; they did the math and the heavy lifting.

Proven Facts: They mathematically proved that the "dual" of a cyclic code (think of it as the code's shadow or opposite) is also a cyclic code. They proved the relationship between the twist map and the rotation.
Simulated Results: To see how many of these codes actually exist, they used a powerful computer program called MAGMA to simulate and list every single unique cyclic code for lengths up to 7.
- For length 1, there are 2 codes.
- For length 2, there are 6 codes.
- For length 3, there are 8 codes.
- For length 4, there are 20 codes.
- For length 5, there are 8 codes.
- For length 6, there are 45 codes.
- For length 7, there are 17 codes.

They found that for lengths 1, 3, 5, and 7, all the codes were "untwisted" (straight lines). But for lengths 2, 4, and 6, they found "twisted" codes (the tangled rebels).

Did They Break a Record?

Here is the honest truth: The paper does not claim to have found a "super-code" that breaks all previous records for error correction. When they looked at the reflected codes (the Gray images), they found that most had very small distances (1 or 2), which means they aren't the strongest protectors against errors. Even the ones with slightly better numbers (like a code of length 12 with distance 4) were comparable to what was already known, not better.

The real victory here isn't a new "super weapon" for sending messages. The victory is understanding the village. They successfully mapped out the rules of this strange, non-unitary ring, showed us how the "twist" works, and proved that these codes naturally turn into a specific type of binary code (index 2 quasi-cyclic). They built a bridge between a weird, identity-less ring and the familiar world of binary codes, giving us a new way to look at these structures.

So, while they didn't invent a magic shield that stops every error, they did solve the mystery of how these four-element codes dance, twist, and reflect, providing a complete catalog for lengths up to 7 and a solid theory for how they behave.

Technical Summary: Cyclic Codes over a Commutative Non-Unitary Ring of Order 4

Problem Statement
Cyclic codes are fundamental in coding theory due to their algebraic structure and efficient decoding algorithms, typically represented as ideals in polynomial quotient rings $R[x]/\langle x^n - 1\rangle$ . While extensive research exists for cyclic codes over finite fields and unitary rings (such as finite chain rings and principal ideal rings), the theory for cyclic codes over finite non-unitary rings remains incomplete. This paper addresses the specific case of the commutative non-unitary ring $I_2$ of order 4, defined by the presentation $I_2 = \langle a, b \mid 2a = 2b = 0, a^2 = b, ab = 0 \rangle$ . Unlike rings with identity, $I_2$ lacks a multiplicative unit, which prevents the direct application of standard ideal-theoretic characterizations. The primary challenge is to systematically characterize cyclic codes over $I_2$ , determine their duality properties, and analyze their Gray images without the framework of a multiplicative identity.

Methodology
The authors develop a structural theory for $I_2$ -codes by leveraging their associated binary components:

Residue and Torsion Codes: Every $I_2$ -code $C$ is associated with a residue code $res(C)$ and a torsion code $tor(C)$ over the binary field $\mathbb{F}_2$ . The paper establishes that $C$ is uniquely determined by these two binary codes and an additional invariant called the twist map $\tau: res(C) \to \mathbb{F}_2^n / tor(C)$ .
Twisted vs. Untwisted Classification: The authors introduce a dichotomy between "twisted" and "untwisted" codes. An $I_2$ -code is untwisted if it decomposes as a direct sum $C = a \cdot res(C) \oplus b \cdot tor(C)$ ; otherwise, it is twisted, requiring the twist matrix $S$ to describe the interaction between components.
Characterization of Cyclicity: The paper derives a necessary and sufficient condition for an $I_2$ -code to be cyclic. This condition requires that both $res(C)$ and $tor(C)$ are binary cyclic codes and that the twist map $\tau$ is compatible with the cyclic shift operator $\sigma$ (i.e., $\tau(\sigma(r)) = \sigma(\tau(r))$ for all $r \in res(C)$ ).
Gray Maps: The authors utilize a Gray map $\Phi: I_2 \to \mathbb{F}_2^2$ to map $I_2$ -codes to binary codes. They analyze the structural properties of these images, specifically their relationship to quasi-cyclic codes.
Computational Classification: Using the computer algebra system MAGMA, the authors perform an exhaustive classification of permutation-inequivalent nonzero cyclic codes over $I_2$ for lengths $n \leq 7$ .

Key Contributions and Results

Structural Characterization: The paper proves that an $I_2$ -code is cyclic if and only if its residue and torsion codes are binary cyclic and the twist map commutes with the cyclic shift. This provides a complete structural description of cyclic codes over $I_2$ that does not rely on the ring having a unity.
Duality: It is proven that the dual of a cyclic code over $I_2$ is also cyclic. Furthermore, the dual of any cyclic code over $I_2$ is shown to be untwisted.
Gray Image Properties: The authors establish that the Gray image of a cyclic code over $I_2$ is a binary quasi-cyclic code of index 2 and length $2n$ . They also derive bounds on the minimum distance of these Gray images in terms of the minimum distances of the residue and torsion codes. Specifically, for untwisted codes, the minimum distance of the Gray image is $\min\{2d(res(C)), d(tor(C))\}$ , provided both component codes are nonzero.
Classification: A complete list of permutation-inequivalent nonzero cyclic codes for lengths $n \leq 7$ is provided. The results distinguish between twisted and untwisted codes and tabulate their parameters, including minimum distance, self-orthogonality, and weight distributions.
Generator Matrices: Explicit generator matrix representations are provided for both twisted and untwisted cyclic codes, utilizing the residue and torsion generator matrices along with the twist matrix.

Significance and Claims
The paper claims that its primary contribution is the systematic development of the theory of cyclic codes over the specific non-unitary ring $I_2$ . The authors note that while $I_2$ shares the cardinality of other well-studied rings, its algebraic structure differs significantly, particularly in that residue and torsion codes alone are insufficient to characterize the code without the twist map.

Regarding the practical utility of the results, the authors are modest. They observe that while the Gray images of these codes yield binary quasi-cyclic codes of index 2, the resulting parameters (particularly for lengths $n \leq 7$ ) generally do not improve upon the best-known minimum distances for binary quasi-cyclic codes. Consequently, the significance of the work lies not in the construction of new record-breaking error-correcting codes, but rather in:

Providing a rigorous algebraic framework for cyclic codes over non-unitary rings.
Establishing the connection between cyclic codes over $I_2$ and binary quasi-cyclic codes of index 2.
Offering a "residue–torsion–twist" interpretation for these quasi-cyclic codes.
Filling a gap in the literature regarding non-unitary rings, which have been less explored than their unitary counterparts.

The authors conclude by suggesting future directions, including the study of cyclic codes over more general non-unitary rings, self-dual codes over $I_p$ , and potential applications in quantum error-correcting codes derived from these Gray images.

The Big Discovery: The "Twist" in the Tale

The Magic Mirror: The Gray Map

What They Ruled Out

The Evidence: Simulations and Proofs

Did They Break a Record?

More like this