List decoding subspace codes from insertions and deletions
From MaRDI portal
Publication:2826055
DOI10.1145/2090236.2090252zbMath1348.94103arXiv1202.0535MaRDI 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
network coding; Gabidulin codes; linearized polynomials; codes over Grassmanians; folded Reed-Solomon codes; list error-correction
Related Items
Rank-Metric Codes and Their Applications, On the geometry of balls in the Grassmannian and list decoding of lifted Gabidulin codes, Algebraic decoding of folded Gabidulin codes
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