List decoding subspace codes from insertions and deletions

DOI10.1145/2090236.2090252zbMath1348.94103arXiv1202.0535OpenAlexW2167890515MaRDI QIDQ2826055

Carol J. Wang, Srivatsan Narayanan, Venkatesan Guruswami

Publication date: 7 October 2016

Published in: Proceedings of the 3rd Innovations in Theoretical Computer Science Conference (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1202.0535

zbMATH Keywords

network codingGabidulin codeslinearized polynomialscodes over Grassmaniansfolded Reed-Solomon codeslist error-correction

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Cyclic codes (94B15) Decoding (94B35)

Related Items (3)

On the geometry of balls in the Grassmannian and list decoding of lifted Gabidulin codes ⋮ Algebraic decoding of folded Gabidulin codes ⋮ Rank-Metric Codes and Their Applications

Cites Work

• Unnamed Item
• The reproducible properties of correct forecasts
• The dimensions of individual strings and sequences
• Effective Strong Dimension in Algorithmic Information and Computational Complexity
• The Complexity of Forecast Testing
• The Well-Calibrated Bayesian
• Asymptotic calibration
• Dimension in Complexity Classes
• Universal prediction
• THE FRACTIONAL DIMENSION OF A SET DEFINED BY DECIMAL PROPERTIES

This page was built for publication: List decoding subspace codes from insertions and deletions