Constant-Rank Codes and Their Connection to Constant-Dimension Codes
From MaRDI portal
Publication:5281390
DOI10.1109/TIT.2010.2048447zbMATH Open1366.94591arXiv0803.2262OpenAlexW2158464899MaRDI QIDQ5281390FDOQ5281390
Authors: Maximilien Gadouleau, Z. Y. Yan 
Publication date: 27 July 2017
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Abstract: Constant-dimension codes have recently received attention due to their significance to error control in noncoherent random linear network coding. What the maximal cardinality of any constant-dimension code with finite dimension and minimum distance is and how to construct the optimal constant-dimension code (or codes) that achieves the maximal cardinality both remain open research problems. In this paper, we introduce a new approach to solving these two problems. We first establish a connection between constant-rank codes and constant-dimension codes. Via this connection, we show that optimal constant-dimension codes correspond to optimal constant-rank codes over matrices with sufficiently many rows. As such, the two aforementioned problems are equivalent to determining the maximum cardinality of constant-rank codes and to constructing optimal constant-rank codes, respectively. To this end, we then derive bounds on the maximum cardinality of a constant-rank code with a given minimum rank distance, propose explicit constructions of optimal or asymptotically optimal constant-rank codes, and establish asymptotic bounds on the maximum rate of a constant-rank code.
Full work available at URL: https://arxiv.org/abs/0803.2262
Recommendations
- On the extendability of particular classes of constant dimension codes
- A note on optimal constant dimension codes
- Construction of constant dimension codes in some cases
- Construction of constant dimension codes in some cases
- Constant dimension codes from Riemann-Roch spaces
- Generalized Linkage Construction for Constant-Dimension Codes
- New Constant-Dimension Subspace Codes from Maximum Rank Distance Codes
- Constacyclic codes over \(R_k\)
- The interplay of different metrics for the construction of constant dimension codes
- On relative constant-weight codes
Cited In (18)
- On the geometry of balls in the Grassmannian and list decoding of lifted Gabidulin codes
- Efficient decoding of interleaved subspace and Gabidulin codes beyond their unique decoding radius using Gröbner bases
- Non-linear maximum rank distance codes
- Bilateral multilevel construction of constant dimension codes
- Constructions of optimal Ferrers diagram rank metric codes
- New constructions of Sidon spaces
- Several classes of optimal Ferrers diagram rank-metric codes
- A geometric approach to rank metric codes and a classification of constant weight codes
- Combining subspace codes
- A new family of linear maximum rank distance codes
- A note on equidistant subspace codes
- The interplay of different metrics for the construction of constant dimension codes
- Linearity and complements in projective space
- Rank-metric codes and their applications
- Constant dimension codes from Riemann-Roch spaces
- Message encoding and retrieval for spread and cyclic orbit codes
- Equidistant codes in the Grassmannian
- Error-correcting codes based on partial linear maps of finite-dimensional vector spaces
This page was built for publication: Constant-Rank Codes and Their Connection to Constant-Dimension Codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5281390)
