Explicit List-Decodable Rank-Metric and Subspace Codes via Subspace Designs

DOI10.1109/TIT.2016.2544347MaRDI QIDQ2976856zbMATH OpenFDO

Authors Carol J. Wang, Chaoping Xing, Venkatesan Guruswami

Publication date 28 April 2017

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/TIT.2016.2544347

Mathematics Subject Classification ID

Combinatorial codes (94B25)

Cited in

(15)

• On the list decodability of rank-metric codes containing Gabidulin codes
• Lossless dimension expanders via linearized polynomials and subspace designs
• New MRD codes from linear cutting blocking sets
• Subspace designs based on algebraic function fields
• Improved list-decodability of random linear binary codes
• Optimal Rate List Decoding over Bounded Alphabets Using Algebraic-geometric Codes
• scientific article; zbMATH DE number 7250144 (Why is no real title available?)
• A New Class of Rank-Metric Codes and Their List Decoding Beyond the Unique Decoding Radius
• Rank-metric codes and their applications
• Codes in the sum-rank metric: fundamentals and applications
• Variety evasive subspace families
• Short rank-metric codes and scattered subspaces
• Exceptional scattered sequences
• On MSRD codes, h-designs and disjoint maximum scattered linear sets
• Gabidulin codes achieve list decoding capacity with an order-optimal column-to-row ratio

This page was built for publication: Explicit List-Decodable Rank-Metric and Subspace Codes via Subspace Designs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2976856)