🔢 mathematics

When isometry and equivalence for skew constacyclic codes coincide

This paper establishes that $(n,\sigma)$ -isometry and $(n,\sigma)$ -equivalence coincide for most skew constacyclic codes over a commutative ring by characterizing Hamming-weight preserving isomorphisms of their nonassociative ambient Petit rings, thereby proposing refined definitions that lead to tighter code classifications.

Original authors: Monica Nevins, Susanne Pumpluen

Published 2026-04-14

📖 5 min read🧠 Deep dive

CC BY 4.0

Original authors: Monica Nevins, Susanne Pumpluen

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 master codebreaker working for a secret agency. Your job is to organize thousands of different "secret messages" (which mathematicians call codes) into neat filing cabinets. The goal is to make sure you don't file the same message twice under different names, and that you can quickly find the best messages to send.

This paper is about organizing a very specific, tricky type of secret message called Skew Constacyclic Codes. These codes are like puzzles where the pieces shift around in a special, twisted way when you move them.

Here is the story of what the authors, Monica and Susanne, discovered, explained in simple terms:

1. The Two Ways to Sort Files

In the world of these codes, mathematicians had two different rules for deciding if two codes were "the same" (or equivalent):

Rule A (The Strict Sort): You can only swap files if you use a very specific, simple tool that shifts the pieces in a straight line.
Rule B (The Flexible Sort): You can swap files using a more complex tool that might twist the pieces, rotate them, or jump them around in a weird pattern (like a knight in chess).

For a long time, people thought Rule B was much more powerful. They believed that because you had more tools, you could group many more codes together as "the same." They thought Rule B would create fewer, bigger filing cabinets.

2. The Big Surprise: The "Ghost" Tools

The authors went into the math lab to check if these "complex tools" (Rule B) actually existed. They were looking for a specific type of mathematical machine that could twist the codes without breaking them.

What they found was shocking:
In most cases, the complex tools don't exist!

It turns out that for the vast majority of these twisted codes, the only way to move them around without breaking the message is to use the simple, straight-line tool (Rule A). The "complex" tools they thought existed were like ghosts—people imagined them, but they aren't real.

The Analogy:
Imagine you have a Rubik's Cube. You thought you could solve it by spinning it in a weird, diagonal way that no one had ever seen before. The authors proved that, for most cubes, that diagonal spin is impossible. You must use the standard up/down/left/right moves.

3. Why This Matters: The "Non-Associative" Trap

Why did people think the complex tools existed? Because they were looking at a special kind of math box called a Petit Ring.

The Normal Box (Associative): In a normal math box, if you do $(A \times B) \times C$ , it's the same as $A \times (B \times C)$ . The order doesn't matter.
The Weird Box (Non-Associative): In the Petit Rings used for these codes, the order does matter. $(A \times B) \times C$ might give a totally different result than $A \times (B \times C)$ .

The authors proved that in these "Weird Boxes," the complex tools (higher-degree isometries) simply cannot function. The math breaks if you try to use them. The only tools that work are the simple ones (degree one).

4. The Correction: Fixing the Filing System

Because of this discovery, the authors had to correct a previous paper (by Ou-azzou et al.) that had claimed there were many more ways to group these codes.

The Old View: "We have 100 different types of codes, but we can group them into 10 big families using our complex tools."
The New View: "Actually, those complex tools don't work. We can only group them into 50 families using simple tools."

This means the classification of these codes is tighter. There are more distinct types of codes than previously thought, and we need to be more careful not to mix them up.

5. The "Magic" Exception

There is one tiny exception. If the "Weird Box" happens to be a "Normal Box" (which happens only under very specific, rare conditions), then the complex tools do exist. But the authors showed that even in this rare case, the complex tool is just a disguise for a simple tool doing a different job. It doesn't actually create new groupings; it just rearranges the existing ones.

The Takeaway for Everyone

This paper is like a detective story where the investigators realized that the "super-weapons" everyone was bragging about were actually just toys.

For Code Makers: You don't need to worry about those complex, twisting tools. They don't exist for most of your codes. You can stick to the simple, reliable methods.
For Security: This helps us understand exactly how many unique, secure codes we actually have. It prevents us from accidentally thinking two different codes are the same when they aren't.

In short: The math is simpler than we thought. The "twisted" ways of sorting these codes are mostly illusions. The universe of these codes is more rigid, and therefore, more predictable, than we hoped.

1. Problem Statement and Context

The paper addresses the classification of skew constacyclic codes (and more generally, skew polycyclic codes) over a commutative base ring $S$ . These codes are defined by a shift operation involving an automorphism $\sigma \in \text{Aut}(S)$ and a unit $a \in S$ .

Ambient Rings: The codes correspond to principal left ideals in Petit rings, denoted $S_f = S[t; \sigma]/S[t; \sigma]f(t)$ , where $f(t) = t^n - a$ . These rings are generally non-associative.
The Core Issue: Researchers seek to classify these codes up to isometry (Hamming-weight preserving isomorphism). Previous literature (specifically Ou-azzou et al., [OaNA25]) proposed two distinct notions:
1. $(n, \sigma)$ -equivalence: Isomorphisms of degree 1 (mapping $t \mapsto \alpha t$ ).
2. $(n, \sigma)$ -isometry: Isomorphisms of arbitrary degree $k$ (mapping $t \mapsto \alpha t^k$ ).
The Gap: It was previously assumed that higher-degree isometries ( $k > 1$ ) were common and that the two notions of equivalence were distinct. The authors identify an error in [OaNA25, Theorem 4] which incorrectly asserted the equivalence of certain conditions for the existence of such isometries. The paper aims to rigorously determine when these two notions coincide and to characterize the full set of Hamming-weight preserving isomorphisms.

2. Methodology

The authors employ a combination of non-associative algebra, skew polynomial theory, and combinatorial arguments to analyze the structure of homomorphisms between Petit rings.

Algebraic Framework: They work with the non-associative ring structure of $S_f$ defined by the rule $g \circ h = gh \pmod_r f$ .
Power-Associativity Analysis: A critical step involves determining when a monomial element $\alpha t^k$ in a non-associative ring is power-associative (i.e., when $(\alpha t^k)^s$ is well-defined regardless of parenthesization). This is a prerequisite for defining a ring homomorphism $G(t) = \alpha t^k$ .
Combinatorial Proofs: The authors use detailed combinatorial arguments (Lemma 3.2, Theorem 3.3) to derive necessary and sufficient conditions for the existence of monomial homomorphisms of degree $k > 1$ .
Extension to Non-Monomial Maps: In Section 6, they extend the analysis to non-monomial polynomial homomorphisms, proving their non-existence under specific conditions (integral domains, $m \nmid n$ ).

3. Key Contributions and Results

A. Characterization of Monomial Homomorphisms (Theorems 3.3 & 4.4)

The paper establishes precise conditions under which a map $G: S_{t^n-a} \to S_{t^n-b}$ defined by $G(t) = \alpha t^k$ is a well-defined ring homomorphism.

Power-Associativity Condition: For $\alpha t^k$ to be power-associative in $S_{t^n-b}$ , it is necessary and sufficient that:
$\alpha b = \sigma^n(\alpha)\sigma^k(b)$
Degree Constraints: If $S_{t^n-b}$ $S_{t^{n} - b}$ is proper non-associative (meaning it is not an associative ring), then no monomial homomorphism of degree $k > 1$ $k > 1$ exists.
- Specifically, if $m \nmid n$ (where $m$ is the order of $\sigma$ ) or if $a, b \notin S^\sigma$ (the fixed ring), then any Hamming-weight preserving isomorphism must be of degree 1 ( $k=1$ ).
Associative Case: Degree $k > 1$ isomorphisms only exist if the ambient rings are associative (which requires $m \mid n$ and $a, b \in S^\sigma$ ).

B. Coincidence of Isometry and Equivalence (Corollary 4.5)

The most significant result is that for proper non-associative Petit rings (the generic case for skew constacyclic codes), the notions of $(n, \sigma)$ -isometry and $(n, \sigma)$ -equivalence coincide.

There are no "hidden" higher-degree isometries that preserve Hamming weight.
This corrects the error in [OaNA25], which assumed the existence of such maps and consequently misclassified code equivalence classes.

C. Correction of Previous Classification (Section 5)

The authors provide explicit counterexamples (Example 5.5) showing that the conditions proposed in [OaNA25, Theorem 4] for the existence of isometries are not sufficient.

They derive the correct formula for the number of distinct $(n, \sigma)$ -isometry classes of skew constacyclic codes over a finite field $K = \mathbb{F}_{p^r}$ .
Theorem 5.9: The number of classes $N$ $N$ is:
- $\gcd([n]_s, p^r - 1)$ if $m \nmid n$ (non-associative case).
- A modified count involving subtraction of associative cases if $m \mid n$ .

D. New Definitions of Equivalence (Definition 5.1)

The authors propose refined definitions of isometry and equivalence that capture all possible Hamming-weight preserving isomorphisms between the ambient rings.

Isometry: Exists if there is a monomial isomorphism $G_{\tau, \alpha, k}$ for any $1 \le k < n$ .
Equivalence: Exists if there is a monomial isomorphism $G_{\tau, \alpha}$ (degree 1).
They prove that for non-associative rings, these two definitions yield the same classification, leading to a "tighter" and more accurate grouping of codes.

E. Non-Monomial Homomorphisms (Section 6)

The paper investigates whether non-monomial polynomial maps can exist.

Theorem 6.1 & Corollary 6.2: If $S$ is an integral domain and $m \nmid n$ , then every non-zero homomorphism between proper non-associative Petit rings must be a monomial of degree 1.
This implies that for the vast majority of skew constacyclic codes, the only structure-preserving maps are the simple linear ones (degree 1).

4. Significance and Impact

Correction of Literature: The paper definitively corrects the classification theory presented in [OaNA25], removing the false assumption that higher-degree isometries are common. This prevents the erroneous merging of distinct code classes.
Simplified Classification: By proving that isometry and equivalence coincide for non-associative rings, the paper simplifies the task of classifying skew constacyclic codes. Researchers no longer need to search for complex higher-degree isometries in the non-associative setting.
Algebraic Insight: The work provides a deep understanding of the structure of Petit rings, specifically the scarcity of power-associative elements of degree $k > 1$ in non-associative settings.
Applications to Cryptography and Coding:
- MRD Codes: The results impact the classification of Maximum Rank Distance (MRD) codes, which correspond to division algebras of this form.
- Post-Quantum Cryptography: The division algebras $K[t; \sigma]/K[t; \sigma](t^n - a)$ are used in lattice-based cryptography (Learning with Errors variations). Understanding their isomorphisms is crucial for parameter selection and security analysis.
- Code De-duplication: The refined classification allows for more accurate "de-duplication" of codes, ensuring that distinct codes are not mistakenly identified as equivalent, and vice versa.

In summary, Nevins and Pumplün establish that for the broad and important class of skew constacyclic codes with non-associative ambient rings, the algebraic structure is rigid: the only Hamming-weight preserving isomorphisms are of degree one. This unifies the concepts of isometry and equivalence and provides a corrected, rigorous framework for future research in coding theory and non-associative algebra.