Constant-rank codes
- 1 July 2008
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 876-880
Abstract
Constant-dimension codes have recently received attention due to their significance to error control in noncoherent random network coding. In this paper, we show that constant- rank codes are closely related to constant-dimension codes and we study the properties of constant-rank codes. We first introduce a relation between vectors in GF(qm)n and subspaces of GF(q)m or GF(q)n, and use it to establish a relation between constant- rank codes and constant-dimension codes. We then derive bounds on the maximum cardinality of constant-rank codes with given rank weight and minimum rank distance. Finally, we investigate the asymptotic behavior of the maximal cardinality of constant- rank codes with given rank weight and minimum rank distance.Keywords
This publication has 17 references indexed in Scilit:
- On the Decoder Error Probability of Bounded Rank-Distance Decoders for Maximum RankDistance CodesIEEE Transactions on Information Theory, 2008
- Bounds on Codes Based on Graph Theory2007
- Network Error Correction, II: Lower BoundsCommunications in Information and Systems, 2006
- Network Error Correction, I: Basic Concepts and Upper BoundsCommunications in Information and Systems, 2006
- Maximum rank distance codes as space~time codesIEEE Transactions on Information Theory, 2003
- Linear authentication codes: bounds and constructionsIEEE Transactions on Information Theory, 2003
- Upper bounds for constant-weight codesIEEE Transactions on Information Theory, 2000
- Distance-Regular Graphs1989
- The Theory of Partitions1984
- A new upper bound for error-correcting codesIEEE Transactions on Information Theory, 1962