Group-Action and Schur Ring Codes

• Group-action and Schur ring codes are linear codes defined by invariance under permutation groups, offering a structured algebraic framework.
• They unify classical cyclic, symmetric, and decimated codes while extending duality and invariance results such as the MacWilliams identity.
• Recent studies on skew polycyclic codes use Schur-ring group actions to achieve concise orbit counts and reveal constraints in code constructions.

A group-action code is a linear code for which a (finite) permutation group $G\leq S_n$ acts as a group of automorphisms on the set of coordinate positions, inducing invariance of the code under the $G$-action. When the algebraic structure is refined further, codes can be viewed as modules over associated Schur rings (also called $S$-rings), allowing a systematic study of the interplay between combinatorial, group-theoretic, and ring-theoretic properties. Schur ring codes and group-action codes unify the classical approach to cyclic, symmetric, and decimated codes and enable a deeper analysis of duality, invariants, and equivalence in coding theory, particularly in the context of codes over various finite rings.

1. Fundamental Structures: Group Actions, Schur Rings, and Codes

Let $R$ be a finite commutative ring, and let $G \leq S_n$ act on the coordinate set $\{1,\dots,n\}$. The natural right $R[G]$-action on $R^n$ is given by permutation of coordinates. A linear code $C\leq R^n$ is a $G$-code precisely when it is an $G$0-submodule, i.e., stable under the action of $G$1.

For such a $G$2, the group algebra $G$3 contains the idempotent

$G$4

which projects $G$5 onto the $G$6-invariant submodule $G$7. The $G$8-orbits partition the coordinates, and the associated Schur ring

$G$9

(with $S$0 the $S$1 orbit-sum) endows this $S$2-invariant module with a rich algebraic structure. A $S$3-code is identified with an $S$4-submodule of $S$5 (Takabayashi, 4 May 2026).

In the setting of the group $S$6 under component-wise multiplication, a Schur ring is a $S$7-span of a partition $S$8 of the group, stable under inversion and multiplication with well-defined structure constants. Subgroups that are unions of basic sets in the partition are called $S$9-subgroups (López, 2019).

2. Group-Action Codes: Duality, Weight Enumerators, and Invariant Theory

Given a $R$0-code $R$1, fix a nondegenerate, $R$2-invariant bilinear form $R$3. The $R$4-dual code is

$R$5

with $R$6 the sum-form on $R$7-orbit coordinates.

The $R$8-MacWilliams identity relates the $R$9-Hamming weight enumerators of $G \leq S_n$0 and $G \leq S_n$1:

$G \leq S_n$2

where $G \leq S_n$3 is a specialization of the $G \leq S_n$4-complete weight enumerator for $G \leq S_n$5 (Takabayashi, 4 May 2026).

The $G \leq S_n$6-full weight enumerator $G \leq S_n$7 (with basis $G \leq S_n$8 of $G \leq S_n$9) is invariant under a generalized Clifford–Weil group $\{1,\dots,n\}$0 if and only if $\{1,\dots,n\}$1 is $\{1,\dots,n\}$2-self-dual and $\{1,\dots,n\}$3-isotropic. Clifford–Weil groups are generated by parabolic multipliers, quadratic shifts, and certain Fourier-like transforms.

A generalization of the Gleason theorem asserts that every $\{1,\dots,n\}$4-invariant in $\{1,\dots,n\}$5 is generated as a $\{1,\dots,n\}$6-linear combination of $\{1,\dots,n\}$7 for $\{1,\dots,n\}$8-self-dual isotropic codes. All $\{1,\dots,n\}$9-code invariants are captured, generalizing the classical invariants of self-dual codes to the group-action setting (Takabayashi, 4 May 2026).

3. Schur-Ring Codes: Constructions and Permutation Groups

In the binary setting ($R[G]$0), codes constructed with respect to Schur rings and permutation actions of $R[G]$1, $R[G]$2, and $R[G]$3 (cyclic, decimation, and symmetry groups) exhibit distinct structures:

• Cyclic Code ($R[G]$4): Generated by $R[G]$5 with $R[G]$6, both a $R[G]$7-code and a $R[G]$8-code; $R[G]$9 (López, 2019).
• Decimated Code ($R^n$0): Generated by $R^n$1, invariant under decimation action via $R^n$2.
• Symmetric Code ($R^n$3): For $R^n$4 odd, constructed as $R^n$5 by symmetrization under the reversal group $R^n$6.

Any code that is both a $R^n$7-code (unique product factorization) and a $R^n$8-code (group-invariance) generates a free $R^n$9-subgroup, showing the close connection between code theory and Schur ring theory (López, 2019).

4. Classification of Skew Polycyclic Codes via Schur-Ring Group Actions

When considering skew polycyclic codes over finite chain rings $C\leq R^n$0 with automorphism $C\leq R^n$1, central trinomials $C\leq R^n$2 lead to codes defined as left $C\leq R^n$3-ideals in $C\leq R^n$4. The Schur ring structure arises in the group of binomials

$C\leq R^n$5

with the Schur product

$C\leq R^n$6

Hamming equivalence of two code-families is governed by a Schur-group action: two trinomials $C\leq R^n$7 are $C\leq R^n$8-equivalent if $C\leq R^n$9 (the image under a specific $G$0-norm group homomorphism). This shows that group-action orbits yield isometric code families: one need only classify the canonical family $G$1, with remaining families related via the Schur group action. The size of each equivalence class/orbit is computed explicitly in terms of the structure of $G$2 and the kernel of the norm map (Bajalan et al., 4 May 2026).

5. Extensions and Constraints: S-Subgroups, Complete Sets, and Impossibility Results

The structure of $G$3-subgroups and their relation to codes shows that while large free subgroups can be constructed (as with cyclic, decimated, and symmetric codes), there are constraints. In the full symmetric Schur ring $G$4, the basic sets $G$5 are Hamming weight classes. However, it is shown that there is no code in any $G$6-complete $G$7-set whose generated subgroup is the entire $G$8; the product structure of basic sets confines generated subgroups to even- or odd-weight classes only (López, 2019).

A plausible implication is that group-action codes often trade off maximal subgroup generation for structural regularity and invariance, providing rich families of codes (often with desirable duality or combinatorial properties) at the expense of covering all possible codes.

6. Examples and Explicit Computations

As an explicit case, consider $G$9, $G$00, and $G$01. The $G$02-invariant submodule $G$03 corresponds to all vectors of the form $G$04; the Schur ring is spanned by the orbit-sums $G$05, $G$06. The diagonal code $G$07 is a $G$08-self-dual code, with its $G$09-full weight enumerator invariant under all Clifford–Weil operations (Takabayashi, 4 May 2026).

Tables such as the one below summarize key group actions and their associated code structures:

Group $G$10	Code Type	Invariant Subgroup Generated
$G$11 (cyclic)	$G$12	$G$13
$G$14 (decimation)	$G$15	Cyclotomic subgroup $G$16
$G$17 (symmetry)	$G$18	Symmetric subgroup

Each family yields a free $G$19-subgroup under the corresponding $G$20 action, with explicit generators and invariants (López, 2019).

7. Significance, Impact, and Directions

The unification of group-action and Schur-ring perspectives has enabled a systematic classification of isometry classes of codes, generalized MacWilliams identities, and invariant-theoretic characterizations in coding theory over finite rings and fields. The orbit–stabilizer formalism arising from Schur-group actions (as in the classification of skew polycyclic codes) replaces brute-force enumeration of code families with concise algebraic descriptions, reducing redundancy and providing closed-form orbit counts (Bajalan et al., 4 May 2026).

These results generalize classical code duality and invariance theorems (including the roles of Clifford–Weil groups and Gleason’s theorem) to codes with group-symmetry constraints (Takabayashi, 4 May 2026). They also clarify limitations of code construction within highly symmetric combinatorial frameworks (López, 2019).

Current research directions include generalizing to more elaborate classifying groups, further exploiting Schur ring structures for non-binary alphabets and more general rings, and understanding the interplay between code invariants, module theory, and arithmetic properties of the underlying rings and group actions.