Publication: A complete characterization of irreducible cyclic orbit codes
Date
Date
Date
2011
Conference or Workshop Item
Published version
Abstract
Abstract
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 prop
Metrics
Citations
Additional indexing
Creators (Authors)
Event Title
Event Title
Event Title
WCC 2011 - Seventh Workshop on Coding and Cryptography
Event Location
Event Location
Event Location
Paris
Event Country
Event Country
Event Country
FR
Event Start Date
Event Start Date
Event Start Date
2011-04-11
Event End Date
Event End Date
Event End Date
2011-04-14
Publisher
Publisher
Publisher
HAL-Inria
Page range/Item number
Page range/Item number
Page range/Item number
219
Page end
Page end
Page end
228
Item Type
Item Type
Item Type
Conference or Workshop Item
In collections
Language
Language
Language
English
Date available
Date available
Date available
2012-02-23
Series Name
Series Name
Series Name
Proceedings of the ... International Workshop on Coding and Cryptography
Number
Number
Number
7
OA Status
OA Status
OA Status
Green
Metrics
Citations
Green Open Access
Loading...
