Limitations on Testable Affine-Invariant Codes in the High-Rate Regime

DOI10.1137/1.9781611973730.87MaRDI QIDQ5363048zbMATH OpenOpenAlexFDO

Authors Ameya Velingker, Carol J. Wang, Venkatesan Guruswami, Madhu Sudan

Publication date 5 October 2017

Published in Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/0682f6b0435f69a6e887086755270e3c56bab488

Mathematics Subject Classification ID

Linear codes (general theory) (94B05)

Recommendations

• Limits on the Rate of Locally Testable Affine-Invariant Codes
• Limitation on the Rate of Families of Locally Testable Codes
• Sparse affine-invariant linear codes are locally testable
• Limiting efficiencies of burst-correcting array codes
• Bounds on 2-query locally testable codes with affine tests
• High-Rate Quasi-Cyclic Low-Density Parity-Check Codes Derived From Finite Affine Planes
• Tolerant Linearity Testing and Locally Testable Codes
• Erasure-resilient codes from affine spaces

Cited in

(3)

• 2-transitivity is insufficient for local testability
• Bounds on 2-query locally testable codes with affine tests
• Lower bounds for constant query affine-invariant LCCs and LTCs

This page was built for publication: Limitations on Testable Affine-Invariant Codes in the High-Rate Regime

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