Explicit List-Decodable Rank-Metric and Subspace Codes via Subspace Designs
From MaRDI portal
Publication:2976856
DOI10.1109/TIT.2016.2544347zbMath1359.94797MaRDI QIDQ2976856
Xing, Chaoping, Carol J. Wang, Venkatesan Guruswami
Publication date: 28 April 2017
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Related Items (9)
On the list decodability of rank-metric codes containing Gabidulin codes ⋮ Optimal Rate List Decoding over Bounded Alphabets Using Algebraic-geometric Codes ⋮ New MRD codes from linear cutting blocking sets ⋮ Unnamed Item ⋮ Lossless dimension expanders via linearized polynomials and subspace designs ⋮ Subspace designs based on algebraic function fields ⋮ Unnamed Item ⋮ Rank-Metric Codes and Their Applications ⋮ Codes in the Sum-Rank Metric: Fundamentals and Applications
This page was built for publication: Explicit List-Decodable Rank-Metric and Subspace Codes via Subspace Designs
