[Paper Review] A Complete Characterization of Irreducible Cyclic Orbit Codes

Anna-Lena Trautmann, Joachim Rosenthal|arXiv (Cornell University)|Feb 15, 2011

Cooperative Communication and Network Coding7 references3 citations

TL;DR

This paper provides a complete characterization of irreducible cyclic orbit codes by leveraging the isomorphism between finite vector spaces and Galois extension fields. It derives the cardinality and minimum distance of such codes using the order of companion matrices of irreducible polynomials, showing that these properties depend on the starting subspace and the group's structure, with primitive cases yielding spread codes when the group order matches the Grassmannian size.

ABSTRACT

We give a complete list of orbit codes that are generated by an irreducible cyclic group, i.e. an irreducible group having one generator. We derive some of the basic properties of these codes such as the cardinality and the minimum distance.

Motivation & Objective

• To fully classify irreducible cyclic orbit codes generated by a single invertible matrix over finite fields.
• To determine the cardinality and minimum subspace distance of such codes using algebraic number theory and field isomorphisms.
• To establish a systematic method for computing code parameters based on the order and structure of the generating matrix.
• To generalize results from primitive to non-primitive irreducible cyclic groups, accounting for overlapping orbits in the Grassmannian.
• To unify the understanding of cyclic orbit codes by reducing them to properties of irreducible polynomials and their companion matrices.

Proposed method

• Represent the vector space $\mathbb{F}_q^n$ as a Galois extension field $\mathbb{F}_{q^n}$ using a primitive element $\alpha$ from an irreducible polynomial of degree $n$.
• Model the action of the cyclic group $\mathfrak{G} = \langle P \rangle$ via multiplication by $\alpha$ in the field, where $P$ is the companion matrix of an irreducible polynomial.
• Use the orbit structure of $\mathbb{F}_{q^n}^\times$ under multiplication by $\alpha$ to analyze the distribution of code words in the Grassmannian.
• Compute the minimum distance by analyzing the intersection of subspaces via the difference sets of exponents in the field representation.
• Define $d_{\max}$ as $\log_q(\max\{m(a) \mid a \in D\} + 1)$, where $m(a)$ is the multiplicity of a difference $a$ in the exponent set of the code's elements.
• Apply this framework to both primitive and non-primitive cases, distinguishing between orbits with multiple code word representatives.

Experimental results

Research questions

• RQ1 How can the cardinality and minimum distance of an irreducible cyclic orbit code be fully characterized in terms of the generating matrix?
• RQ2 What role does the order of the companion matrix of an irreducible polynomial play in determining the code's size and distance?
• RQ3 Under what conditions does an irreducible cyclic orbit code achieve the maximum possible minimum distance (i.e., become a spread code)?
• RQ4 How do overlapping orbits of the group action affect the intersection structure and hence the minimum distance of the code?
• RQ5 Can the parameters of any irreducible cyclic orbit code be computed solely from the exponent sets of the starting subspace in the field representation?

Key findings

• The cardinality of an irreducible cyclic orbit code is equal to the order of the companion matrix $P$, i.e., $\mathrm{ord}(P)$, which is the multiplicative order of the root $\alpha$ of the irreducible polynomial.
• For primitive groups (where $\mathrm{ord}(P) = q^n - 1$), the code achieves the maximum possible size $q^n - 1$, and if $k \mid n$, it can be a spread code with minimum distance $2k$.
• The minimum distance of the code is $2k - 2d_{\max}$, where $d_{\max} = \log_q(\max\{m(a) + 1 \mid a \in D\})$, and $D$ is the union of difference sets from all orbits.
• When multiple code words lie in the same orbit, the minimum distance drops due to larger intersections, and the effective code must be re-evaluated on distinct codewords.
• Codes generated by irreducible polynomials of the same degree and order yield codes with identical cardinality and minimum distance, regardless of the specific polynomial.
• The theory reduces the analysis of all irreducible cyclic orbit codes to studying the exponent sets of the starting subspace in the field $\mathbb{F}_{q^n}$, enabling a complete classification.