Constant-Rank Codes and Their Connection to Constant-Dimension Codes
From MaRDI portal
Publication:5281390
DOI10.1109/TIT.2010.2048447zbMath1366.94591arXiv0803.2262OpenAlexW2158464899MaRDI QIDQ5281390
Maximilien Gadouleau, Zhiyuan Yan
Publication date: 27 July 2017
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0803.2262
Related Items (17)
Efficient decoding of interleaved subspace and Gabidulin codes beyond their unique decoding radius using Gröbner bases ⋮ Non-linear maximum rank distance codes ⋮ New constructions of Sidon spaces ⋮ A new family of linear maximum rank distance codes ⋮ Linearity and complements in projective space ⋮ On the geometry of balls in the Grassmannian and list decoding of lifted Gabidulin codes ⋮ Constant dimension codes from Riemann-Roch spaces ⋮ Bilateral multilevel construction of constant dimension codes ⋮ The interplay of different metrics for the construction of constant dimension codes ⋮ Combining subspace codes ⋮ A note on equidistant subspace codes ⋮ Message encoding and retrieval for spread and cyclic orbit codes ⋮ Constructions of optimal Ferrers diagram rank metric codes ⋮ Several classes of optimal Ferrers diagram rank-metric codes ⋮ Error-correcting codes based on partial linear maps of finite-dimensional vector spaces ⋮ Rank-Metric Codes and Their Applications ⋮ Equidistant codes in the Grassmannian
This page was built for publication: Constant-Rank Codes and Their Connection to Constant-Dimension Codes
