Locally Testable and Locally Correctable Codes approaching the Gilbert-Varshamov Bound

DOI10.1109/TIT.2018.2809788MaRDI QIDQ4682880zbMATH OpenOpenAlexFDO

Authors

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

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Combinatorics in computer science (68R05) Combinatorial codes (94B25) Bounds on codes (94B65)

Cited in

(15)

• Complexity theory. Abstracts from the workshop held November 14--20, 2021 (hybrid meeting)
• Limits on the Rate of Locally Testable Affine-Invariant Codes
• Locally testable codes and PCPs of almost-linear length
• Locally Testable and Locally Correctable Codes Approaching the Gilbert-Varshamov Bound
• Limitation on the Rate of Families of Locally Testable Codes
• Local list recovery of high-rate tensor codes and applications
• scientific article; zbMATH DE number 7650135 (Why is no real title available?)
• scientific article; zbMATH DE number 7758332 (Why is no real title available?)
• Erasures versus errors in local decoding and property testing
• Locally testable codes with constant rate, distance, and locality
• Improved List Decoding of Folded Reed-Solomon and Multiplicity Codes
• Nearly optimal pseudorandomness from hardness
• Asymptotically-good RLCCs with \((\log n)^{2+o(1)}\) queries
• Good locally testable codes
• List-recovery of random linear codes over small fields

This page was built for publication: Locally Testable and Locally Correctable Codes approaching the Gilbert-Varshamov Bound

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