The distance distribution of a code is the vector whose ith entry is the number of pairs of codewords with distance i. We investigate the structure of the distance distribution for cyclic orbit codes, which are subspace codes generated by the action of Fqn∗ on an Fq-subspace U of Fqn. Note that Fqn∗ is a Singer cycle in the general linear group of all Fq-automorphisms of Fqn. We show that for full-length orbit codes with maximal possible distance the distance distribution depends only on q,n, and the dimension of U. For full-length orbit codes with lower minimum distance, we provide partial results towards a characterization of the distance distribution, especially in the case that any two codewords intersect in a space of dimension at most 2. Finally, we briefly address the distance distribution of a union of full-length orbit codes with maximum distance.
|Number of pages||24|
|Journal||Designs, Codes, and Cryptography|
|State||Published - Mar 2021|
Bibliographical noteFunding Information:
HGL was partially supported by the Grant #422479 from the Simons Foundation.
© 2021, Springer Science+Business Media, LLC, part of Springer Nature.
- Coding theory
- Cyclic orbit codes
- Subspace codes
ASJC Scopus subject areas
- Theoretical Computer Science
- Computer Science Applications
- Discrete Mathematics and Combinatorics
- Applied Mathematics