Computer Science – Information Theory
Scientific paper
2008-03-06
Computer Science
Information Theory
5 pages, to appear in Proc. IEEE ISIT 2008
Scientific paper
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 $\mathrm{GF}(q^m)^n$ and subspaces of $\mathrm{GF}(q)^m$ or $\mathrm{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.
Gadouleau Maximilien
Yan Zhiyuan
No associations
LandOfFree
Constant-Rank Codes does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Constant-Rank Codes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Constant-Rank Codes will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-13396