Cyclic Subspace Codes

• Cyclic subspace codes are sets of subspaces in projective space that remain invariant under the multiplicative action of finite field elements, forming unions of orbits with precise algebraic properties.
• They utilize the subspace distance defined by intersection dimensions, with orbit sizes determined by stabilizer subfields, which optimizes error correction and network coding performance.
• Algebraic construction methods, including subspace polynomials, Frobenius maps, and Sidon space theory, enable explicit, recursive designs and practical encoding strategies.

Cyclic subspace codes are subspace codes in $\mathcal{P}_q(n)$ that are closed under the multiplicative action of $\mathbb{F}_{q^n}^*$ on subspaces of $\mathbb{F}_{q^n}$, viewed as an $n$-dimensional vector space over $\mathbb{F}_q$. Equivalently, they are unions of multiplicative orbits, and the special case of a single orbit is a single-orbit cyclic subspace code, or orbit code. Within random network coding, this class is valued for the combination of rigid algebraic structure and nontrivial code parameters, and the modern theory connects orbit size, stabilizer subfields, minimum distance, intersection patterns, subspace polynomials, Sidon spaces, and message encoding into a coherent framework (Ben-Sasson et al., 2014).

1. Ambient model, cyclic action, and basic terminology

The standard ambient space is the projective space

$\mathcal P_q(n)=\bigcup_{k=0}^n \mathcal G_q(n,k),$

where $\mathcal G_q(n,k)$ is the Grassmannian of all $k$-dimensional $\mathbb F_q$-subspaces of $\mathbb F_q^n$. In the extension-field model, $\mathbb{F}_{q^n}^*$0 is identified with $\mathbb{F}_{q^n}^*$1, and scalar multiplication by $\mathbb{F}_{q^n}^*$2 acts on a subspace $\mathbb{F}_{q^n}^*$3 by

$\mathbb{F}_{q^n}^*$4

A cyclic subspace code is any code closed under this action, so it is a union of sets of the form

$\mathbb{F}_{q^n}^*$5

When the code consists of exactly one such orbit, it is a single-orbit cyclic subspace code; in related literature this is also called a cyclic orbit code (Garcia et al., 2016).

The metric is the subspace distance

$\mathbb{F}_{q^n}^*$6

For constant-dimension codes, where $\mathbb{F}_{q^n}^*$7,

$\mathbb{F}_{q^n}^*$8

Thus the geometry of cyclic constant-dimension codes is controlled entirely by the dimensions of intersections between a subspace and its cyclic shifts. In the extension-field formulation, this simple identity is the basis for orbit-size calculations, minimum-distance estimates, distance distributions, and explicit constructions (Gluesing-Luerssen et al., 2014).

A related but distinct viewpoint uses a cyclic subgroup of $\mathbb{F}_{q^n}^*$9. If $\mathbb{F}_{q^n}$0 and $\mathbb{F}_{q^n}$1, then

$\mathbb{F}_{q^n}$2

is a cyclic orbit code in the linear-group sense. The extension-field model and the matrix model are compatible through companion-matrix realizations of irreducible or primitive polynomials, and much of the finite-field theory of cyclic subspace codes may be regarded as the irreducible cyclic-subgroup case of orbit-code theory (Horlemann-Trautmann, 2014).

2. Stabilizers, subfields, orbit size, and the “best friend”

For a subspace $\mathbb{F}_{q^n}$3, the stabilizer is

$\mathbb{F}_{q^n}$4

A standard fact used throughout the subject is that $\mathbb{F}_{q^n}$5 is a subfield of $\mathbb{F}_{q^n}$6. Hence

$\mathbb{F}_{q^n}$7

for some divisor $\mathbb{F}_{q^n}$8. Equivalently, $\mathbb{F}_{q^n}$9 is naturally an $n$0-vector space, and orbit-stabilizer gives

$n$1

The case $n$2 is the full-length case: $n$3 while $n$4 yields a degenerate orbit (Mahak et al., 2024).

The same structure is encoded by the largest subfield over which $n$5 is linear. In the primitive setting, this subfield is called the best friend of $n$6, and it coincides with $n$7. If the best friend is $n$8, then $n$9 and

$\mathbb{F}_q$0

Moreover, if $\mathbb{F}_q$1 and $\mathbb{F}_q$2 is the maximum $\mathbb{F}_q$3-dimension of a nontrivial intersection $\mathbb{F}_q$4, then

$\mathbb{F}_q$5

In particular,

$\mathbb{F}_q$6

so the best friend simultaneously controls orbit cardinality and the granularity of possible intersection dimensions (Gluesing-Luerssen et al., 2014).

The extreme case $\mathbb{F}_q$7 occurs exactly for spread-type subfield orbits. If $\mathbb{F}_q$8 and $\mathbb{F}_q$9, then

$\mathcal P_q(n)=\bigcup_{k=0}^n \mathcal G_q(n,k),$0

Conversely, in the primitive cyclic-orbit setting, maximum distance $\mathcal P_q(n)=\bigcup_{k=0}^n \mathcal G_q(n,k),$1 characterizes this subfield case. This makes spread orbits the canonical high-distance, small-cardinality extreme, while full-length orbits sit at the opposite size extreme (Gluesing-Luerssen et al., 2019).

3. Intersection geometry, distance distributions, and arithmetic restrictions

For a constant-dimension orbit code $\mathcal P_q(n)=\bigcup_{k=0}^n \mathcal G_q(n,k),$2, the distance distribution relative to $\mathcal P_q(n)=\bigcup_{k=0}^n \mathcal G_q(n,k),$3 can be written as

$\mathcal P_q(n)=\bigcup_{k=0}^n \mathcal G_q(n,k),$4

The associated intersection distribution is

$\mathcal P_q(n)=\bigcup_{k=0}^n \mathcal G_q(n,k),$5

Since

$\mathcal P_q(n)=\bigcup_{k=0}^n \mathcal G_q(n,k),$6

the two distributions are equivalent: $\mathcal P_q(n)=\bigcup_{k=0}^n \mathcal G_q(n,k),$7 Thus the distance-distribution problem for a single-orbit cyclic subspace code is exactly the problem of counting intersection dimensions between a fixed subspace and its scalar shifts (Mahak et al., 2024).

The modern study of these distributions begins with a structural reinterpretation via fraction sets and multiplicity counting. For full-length orbit codes of minimum distance $\mathcal P_q(n)=\bigcup_{k=0}^n \mathcal G_q(n,k),$8, equivalently for orbits generated by Sidon spaces, the entire distance distribution is universal: it depends only on $\mathcal P_q(n)=\bigcup_{k=0}^n \mathcal G_q(n,k),$9, $\mathcal G_q(n,k)$0, and $\mathcal G_q(n,k)$1, not on the specific generating subspace. If

$\mathcal G_q(n,k)$2

then exactly $\mathcal G_q(n,k)$3 codewords meet a fixed codeword in a line, all remaining codewords meet it trivially, and no other nontrivial intersection dimension occurs. This universality is one of the sharpest general theorems known for cyclic orbit codes (Gluesing-Luerssen et al., 2019).

Outside the optimal Sidon-space regime, the distribution becomes more delicate, but arithmetic regularities persist. For full-length orbit codes, an elementary invariance argument yields that each intersection class is partitioned into packets of size $\mathcal G_q(n,k)$4, hence each $\mathcal G_q(n,k)$5 is a multiple of $\mathcal G_q(n,k)$6. If $\mathcal G_q(n,k)$7 is odd, stronger packet decompositions show that each $\mathcal G_q(n,k)$8 is a multiple of $\mathcal G_q(n,k)$9. When $k$0 is even, degree-$k$1 elements of $k$2 create an exceptional phenomenon tied to copies of $k$3 contained in $k$4: if $k$5 contains

$k$6

distinct cyclic shifts of $k$7, then

$k$8

for some nonnegative integer $k$9, while every other $\mathbb F_q$0 is a multiple of $\mathbb F_q$1. In the general stabilizer case $\mathbb F_q$2, the same pattern lifts to $\mathbb F_q$3: if $\mathbb F_q$4 is odd, then every $\mathbb F_q$5 is a multiple of $\mathbb F_q$6; if $\mathbb F_q$7 is even and $\mathbb F_q$8 contains

$\mathbb F_q$9

distinct cyclic shifts of $\mathbb F_q^n$0, then

$\mathbb F_q^n$1

and all remaining $\mathbb F_q^n$2 are multiples of $\mathbb F_q^n$3 (Mahak et al., 2024).

This arithmetic perspective shows that cyclicity constrains much more than minimum distance. It organizes the full local geometry of an orbit into congruence classes, inverse pairings, and exceptional packets attached to subfield configurations, especially $\mathbb F_q^n$4 or $\mathbb F_q^n$5.

4. Algebraic construction methods: subspace polynomials, Frobenius maps, and quasi-cyclic variants

A principal algebraic tool is the subspace polynomial. For a $\mathbb F_q^n$6-dimensional $\mathbb F_q^n$7-subspace $\mathbb F_q^n$8,

$\mathbb F_q^n$9

is a monic linearized polynomial of the form

$\mathbb{F}_{q^n}^*$00

This representation is faithful: $\mathbb{F}_{q^n}^*$01 if and only if $\mathbb{F}_{q^n}^*$02. It converts cyclic shifts, Frobenius shifts, and intersection problems into coefficient computations. The cyclic action transforms coefficients by

$\mathbb{F}_{q^n}^*$03

while the $\mathbb{F}_{q^n}^*$04-th Frobenius shift satisfies

$\mathbb{F}_{q^n}^*$05

A simple but powerful invariant is the gap between the largest and second-largest nonzero $\mathbb{F}_{q^n}^*$06-degrees: if

$\mathbb{F}_{q^n}^*$07

then $\mathbb{F}_{q^n}^*$08, and one obtains the distance bound

$\mathbb{F}_{q^n}^*$09

This is the basis of many explicit full-length constructions (Ben-Sasson et al., 2014).

The same framework yields explicit cyclic families. If

$\mathbb{F}_{q^n}^*$10

is irreducible over $\mathbb{F}_{q^n}^*$11 and its degree divides $\mathbb{F}_{q^n}^*$12, then

$\mathbb{F}_{q^n}^*$13

is a subspace polynomial over $\mathbb{F}_{q^n}^*$14, and the orbit

$\mathbb{F}_{q^n}^*$15

has

$\mathbb{F}_{q^n}^*$16

For fixed $\mathbb{F}_{q^n}^*$17 and $\mathbb{F}_{q^n}^*$18, this produces such one-orbit full-length cyclic codes for infinitely many $\mathbb{F}_{q^n}^*$19. Frobenius shifts can also be combined to obtain multiple full-length orbits of total size

$\mathbb{F}_{q^n}^*$20

and minimum distance $\mathbb{F}_{q^n}^*$21. At the opposite end of the orbit-size spectrum, if $\mathbb{F}_{q^n}^*$22, the family of all $\mathbb{F}_{q^n}^*$23-subspaces that are also $\mathbb{F}_{q^n}^*$24-subspaces forms a cyclic code

$\mathbb{F}_{q^n}^*$25

of size

$\mathbb{F}_{q^n}^*$26

and minimum distance $\mathbb{F}_{q^n}^*$27 (Ben-Sasson et al., 2014).

A different algebraic line generalizes cyclicity itself. An $\mathbb{F}_{q^n}^*$28-quasi-cyclic subspace code is invariant under

$\mathbb{F}_{q^n}^*$29

Its $\mathbb{F}_{q^n}^*$30-quasi orbit has size

$\mathbb{F}_{q^n}^*$31

for some divisor $\mathbb{F}_{q^n}^*$32. The same two core tools of cyclic-code theory—subspace polynomials and Frobenius mappings—remain effective in this setting, and one obtains one-quasi-orbit and multi-quasi-orbit construction methods parallel to the ordinary cyclic case (Garcia et al., 2016).

A further extension replaces one seed Sidon space by sums of several Sidon spaces. If $\mathbb{F}_{q^n}^*$33 and $\mathbb{F}_{q^n}^*$34 are Sidon spaces satisfying

$\mathbb{F}_{q^n}^*$35

and

$\mathbb{F}_{q^n}^*$36

then $\mathbb{F}_{q^n}^*$37 is again a Sidon space. More generally, if $\mathbb{F}_{q^n}^*$38 are Sidon spaces with

$\mathbb{F}_{q^n}^*$39

and pairwise scalar intersections of dimension at most $\mathbb{F}_{q^n}^*$40, then $\mathbb{F}_{q^n}^*$41 is Sidon. This criterion produces many new full-length one-orbit cyclic codes of distance $\mathbb{F}_{q^n}^*$42 by turning smaller Sidon building blocks into larger ones (Li et al., 2021).

5. Sidon spaces, large families, classification results, and asymptotic constructions

A $\mathbb{F}_{q^n}^*$43-dimensional subspace $\mathbb{F}_{q^n}^*$44 is a Sidon space if for all nonzero $\mathbb{F}_{q^n}^*$45,

$\mathbb{F}_{q^n}^*$46

This condition is equivalent to the orbit code $\mathbb{F}_{q^n}^*$47 being full-length and having minimum distance $\mathbb{F}_{q^n}^*$48. It is also the central bridge between multiplicative combinatorics and cyclic subspace coding. In the multi-orbit setting, compatible families of Sidon spaces give cyclic subspace codes obtained as unions of full-length orbits while preserving minimum distance $\mathbb{F}_{q^n}^*$49 (Gluesing-Luerssen et al., 2019).

Large families of such unions are now known. One construction yields cyclic $\mathbb{F}_{q^n}^*$50-codes of size

$\mathbb{F}_{q^n}^*$51

for $\mathbb{F}_{q^n}^*$52, $\mathbb{F}_{q^n}^*$53, and $\mathbb{F}_{q^n}^*$54. A second construction, for $\mathbb{F}_{q^n}^*$55, gives size

$\mathbb{F}_{q^n}^*$56

In the case $\mathbb{F}_{q^n}^*$57, the latter family is within a factor of $\mathbb{F}_{q^n}^*$58 of the sphere-packing bound as $\mathbb{F}_{q^n}^*$59 goes to infinity. These constructions are built from explicit parameterized families of Sidon spaces and controlled pairwise products among them (Yu et al., 2023).

At low dimension, one-orbit cyclic codes admit explicit classifications. In $\mathbb{F}_{q^n}^*$60, three-dimensional one-orbit cyclic subspace codes fall into three families: the spread case $\mathbb{F}_{q^n}^*$61, the optimum-distance full-length case with minimum distance $\mathbb{F}_{q^n}^*$62, and the full-length minimum-distance-$\mathbb{F}_{q^n}^*$63 case. The classification is organized by $\mathbb{F}_{q^n}^*$64, together with semilinear invariants such as $\mathbb{F}_{q^n}^*$65 and $\mathbb{F}_{q^n}^*$66, and it isolates explicit normal forms including

$\mathbb{F}_{q^n}^*$67

for the distance-$\mathbb{F}_{q^n}^*$68 families (Castello et al., 2024).

A different classification problem concerns full weight spectrum one-orbit cyclic subspace codes, namely those realizing all possible nonzero subspace distances. These are completely classified: every such code is, up to cyclic shift, of exactly one of two types. The first is the polynomial-basis family

$\mathbb{F}_{q^n}^*$69

subject to explicit bounds on $\mathbb{F}_{q^n}^*$70 relative to $\mathbb{F}_{q^n}^*$71; the second is a quadratic-extension family

$\mathbb{F}_{q^n}^*$72

with explicit restrictions on $\mathbb{F}_{q^n}^*$73. This result shows that full weight spectrum is highly rigid in the one-orbit cyclic setting (Castello et al., 2024).

Recent asymptotic progress comes from a recursive product construction across towers of field extensions. If

$\mathbb{F}_{q^n}^*$74

with

$\mathbb{F}_{q^n}^*$75

then one can form

$\mathbb{F}_{q^n}^*$76

with

$\mathbb{F}_{q^n}^*$77

Iterating this operation produces large multi-orbit cyclic subspace codes for composite $\mathbb{F}_{q^n}^*$78. In particular, for $\mathbb{F}_{q^n}^*$79, the resulting families are asymptotically optimal with respect to the Johnson type bound II for infinitely many $\mathbb{F}_{q^n}^*$80; for $\mathbb{F}_{q^n}^*$81 and $\mathbb{F}_{q^n}^*$82, the constructions approach Johnson within factor $\mathbb{F}_{q^n}^*$83 (Castello et al., 12 Jul 2025).

6. Encoding, applications, and related generalizations

For cyclic orbit codes, message encoding is naturally indexed by exponents. If

$\mathbb{F}_{q^n}^*$84

with orbit size $\mathbb{F}_{q^n}^*$85, then the message set is

$\mathbb{F}_{q^n}^*$86

and the encoder is

$\mathbb{F}_{q^n}^*$87

In the primitive case, this can be implemented in complexity $\mathbb{F}_{q^n}^*$88. The inverse problem is fundamentally harder: after decoding to $\mathbb{F}_{q^n}^*$89, message retrieval becomes a discrete logarithm problem in the multiplicative group generated by the field element corresponding to $\mathbb{F}_{q^n}^*$90. Using Pohlig–Hellman, if

$\mathbb{F}_{q^n}^*$91

the retrieval complexity is

$\mathbb{F}_{q^n}^*$92

A hybrid method avoids this bottleneck in spread-orbit cases by transferring encoding and retrieval through semilinear isometries to Desarguesian spread codes (Horlemann-Trautmann, 2014).

Cyclic subspace codes also serve as ingredients in other coding theories. A multi-orbit cyclic subspace code

$\mathbb{F}_{q^n}^*$93

with minimum distance $\mathbb{F}_{q^n}^*$94 yields, via affine translates of the representatives $\mathbb{F}_{q^n}^*$95, an optical orthogonal code of parameters

$\mathbb{F}_{q^n}^*$96

and size

$\mathbb{F}_{q^n}^*$97

In the important case $\mathbb{F}_{q^n}^*$98, the resulting parameters are

$\mathbb{F}_{q^n}^*$99

This construction gives a multiplicative finite-field route from cyclic subspace codes to OOCs, distinct from additive character-sum and purely combinatorial approaches (Ozbudak et al., 2024).

The orbit-code viewpoint also extends from single subspaces to flags. A cyclic orbit flag code is an orbit of a flag

$\mathbb{F}_{q^n}$00

under a cyclic subgroup, and each projected component

$\mathbb{F}_{q^n}$01

is itself a cyclic orbit subspace code. The stabilizer/best-friend formalism survives at flag level, but new compatibility conditions arise because the flag stabilizer is the intersection of the stabilizers of its coordinates. Thus ordinary cyclic subspace codes reappear as the one-coordinate shadow of a broader orbit theory on nested subspaces (Alonso-González et al., 2021).

Taken together, these developments present cyclic subspace codes as a mature algebraic domain: they admit exact orbit-size formulas via stabilizer subfields, refined local invariants via intersection and distance distributions, explicit constructions through subspace polynomials and Sidon spaces, classification theorems in special regimes, recursive asymptotic constructions, concrete encoding maps, and nontrivial applications outside network coding.