Locally Testable and Locally Correctable Codes Approaching the Gilbert-Varshamov Bound
From MaRDI portal
Publication:4575883
DOI10.1137/1.9781611974782.135zbMath1443.94111OpenAlexW2579367135MaRDI QIDQ4575883
No author found.
Publication date: 16 July 2018
Published in: Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/1.9781611974782.135
Analysis of algorithms and problem complexity (68Q25) Combinatorics in computer science (68R05) Bounds on codes (94B65) Combinatorial codes (94B25)
Related Items (3)
Fast Reed-Solomon Interactive Oracle Proofs of Proximity ⋮ Unnamed Item ⋮ Outlaw distributions and locally decodable codes
This page was built for publication: Locally Testable and Locally Correctable Codes Approaching the Gilbert-Varshamov Bound
