Locally Testable and Locally Correctable Codes approaching the Gilbert-Varshamov Bound
From MaRDI portal
Publication:4682880
DOI10.1109/TIT.2018.2809788zbMath1401.94208OpenAlexW2791574816MaRDI QIDQ4682880
No author found.
Publication date: 19 September 2018
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/tit.2018.2809788
Analysis of algorithms and problem complexity (68Q25) Combinatorics in computer science (68R05) Bounds on codes (94B65) Combinatorial codes (94B25)
Related Items (6)
Erasures versus errors in local decoding and property testing ⋮ Improved List Decoding of Folded Reed-Solomon and Multiplicity Codes ⋮ Unnamed Item ⋮ Complexity theory. Abstracts from the workshop held November 14--20, 2021 (hybrid meeting) ⋮ Local List Recovery of High-Rate Tensor Codes and Applications ⋮ Unnamed Item
This page was built for publication: Locally Testable and Locally Correctable Codes approaching the Gilbert-Varshamov Bound
