Cyclic Orbit Codes
arXiv:1112.1238 · doi:10.1109/TIT.2013.2274266
Abstract
In network coding a constant dimension code consists of a set of k-dimensional subspaces of F_q^n. 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 F_q^n. If the acting group is cyclic, the corresponding orbit codes are called cyclic orbit codes. In this paper we give a classification of cyclic orbit codes and propose a decoding procedure for a particular subclass of cyclic orbit codes.
submitted to IEEE Transactions on Information Theory
References in corpus (6)
- A Rank-Metric Approach to Error Control in Random Network Coding
- Spread Codes and Spread Decoding in Network Coding
- Construction of Large Constant Dimension Codes With a Prescribed Minimum Distance
- Recursive Code Construction for Random Networks
- A Complete Characterization of Irreducible Cyclic Orbit Codes and their Plücker Embedding
- On conjugacy classes of subgroups of the general linear group and cyclic orbit codes