Cyclic Orbit Codes
Top Cited Papers
- 1 August 2013
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 59 (11) , 7386-7404
Abstract
A constant dimension code consists of a set of k-dimensional subspaces of \BBF qn. Orbit codes are constant dimension codes which are defined as orbits of a subgroup of the general linear group, acting on the set of all subspaces of \BBF qn. If the acting group is cyclic, the corresponding orbit codes are called cyclic orbit codes. In this paper, we show how orbit codes can be seen as an analog of linear codes in the block coding case. We investigate how the structure of cyclic orbit codes can be utilized to compute the minimum distance and cardinality of a given code and propose different decoding procedures for a particular subclass of cyclic orbit codes.Keywords
All Related Versions
This publication has 27 references indexed in Scilit:
- Linearity and complements in projective spaceLinear Algebra and its Applications, 2013
- A complete characterization of irreducible cyclic orbit codes and their Plücker embeddingDesigns, Codes and Cryptography, 2012
- An algebraic approach for decoding spread codesAdvances in Mathematics of Communications, 2012
- On lattices, binary codes, and network codesAdvances in Mathematics of Communications, 2011
- Johnson type bounds on constant dimension codesDesigns, Codes and Cryptography, 2008
- Codes and Anticodes in the Grassman GraphJournal of Combinatorial Theory, Series A, 2002
- Network information flowIEEE Transactions on Information Theory, 2000
- Designs over finite fieldsGeometriae Dedicata, 1987
- t-designs on hypergraphsDiscrete Mathematics, 1976
- Group codes for the Gaussian channel (Abstr.)IEEE Transactions on Information Theory, 1968