A Complete Characterization of Irreducible Cyclic Orbit Codes - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2011

A Complete Characterization of Irreducible Cyclic Orbit Codes


Constant dimension codes are subsets of the nite Grassmann variety. The study of constant dimension codes with good distances have been central in random linear network coding theory. Orbit codes represent a subclass of constant dimension codes. They are characterized that the elements of the code can be viewed as the orbit under a group action. The paper gives a complete characterization of orbit codes that are generated by an irreducible cyclic group, i.e. an irreducible group having one generator. We show how some of the basic properties of these codes, the cardinality and the minimum distance, can be derived using the isomorphism of the vector space and the extension fi eld.
Fichier principal
Vignette du fichier
83.pdf (131.71 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

inria-00611789 , version 1 (27-07-2011)


  • HAL Id : inria-00611789 , version 1


Anna-Lena Trautmann, Joachim Rosenthal. A Complete Characterization of Irreducible Cyclic Orbit Codes. WCC 2011 - Workshop on coding and cryptography, Apr 2011, Paris, France. pp.219-228. ⟨inria-00611789⟩


186 View
429 Download


Gmail Facebook X LinkedIn More