UZH-Logo

Maintenance Infos

A complete characterization of irreducible cyclic orbit codes - Zurich Open Repository and Archive


Trautmann, A L; Rosenthal, J (2011). A complete characterization of irreducible cyclic orbit codes. In: WCC 2011 - Seventh Workshop on Coding and Cryptography, Paris, FR, 11 April 2011 - 14 April 2011, 219-228.

Abstract

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 field.

Abstract

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 field.

Downloads

127 downloads since deposited on 23 Feb 2012
47 downloads since 12 months
Detailed statistics

Additional indexing

Item Type:Conference or Workshop Item (Other), not refereed, original work
Communities & Collections:07 Faculty of Science > Institute of Mathematics
Dewey Decimal Classification:510 Mathematics
Language:English
Event End Date:14 April 2011
Deposited On:23 Feb 2012 21:18
Last Modified:30 May 2017 05:45
Publisher:HAL-Inria
Series Name:Proceedings of the ... International Workshop on Coding and Cryptography
Number:7
Official URL:http://hal.inria.fr/inria-00611789
Related URLs:http://arxiv.org/abs/1102.3167
http://wcc2011.inria.fr/ (Organisation)

Download

Preview Icon on Download
Preview
Content: Published Version
Language: English
Filetype: PDF
Size: 216kB
Preview Icon on Download
Preview
Content: Accepted Version
Filetype: PDF (Version 1)
Size: 142kB
Preview Icon on Download
Preview
Content: Accepted Version
Filetype: PDF (Version 2)
Size: 150kB
Preview Icon on Download
Preview
Content: Accepted Version
Filetype: PDF (Version 3)
Size: 150kB
Preview Icon on Download
Preview
Content: Accepted Version
Filetype: PDF (Version 4)
Size: 150kB

TrendTerms

TrendTerms displays relevant terms of the abstract of this publication and related documents on a map. The terms and their relations were extracted from ZORA using word statistics. Their timelines are taken from ZORA as well. The bubble size of a term is proportional to the number of documents where the term occurs. Red, orange, yellow and green colors are used for terms that occur in the current document; red indicates high interlinkedness of a term with other terms, orange, yellow and green decreasing interlinkedness. Blue is used for terms that have a relation with the terms in this document, but occur in other documents.
You can navigate and zoom the map. Mouse-hovering a term displays its timeline, clicking it yields the associated documents.

Author Collaborations