Locally Testable vs. Locally Decodable Codes

DOI10.1007/978-3-642-15369-3_50zbMath1306.94108OpenAlexW1578703824MaRDI QIDQ3588443

Michael Viderman, Tali Kaufman

Publication date: 10 September 2010

Published in: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-15369-3_50

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Decoding (94B35) Error probability in coding theory (94B70)

Related Items (6)

Composition of semi-LTCs by two-wise tensor products ⋮ On coset leader graphs of structured linear codes ⋮ Towards lower bounds on locally testable codes via density arguments ⋮ Limitation on the Rate of Families of Locally Testable Codes ⋮ On the Power of Relaxed Local Decoding Algorithms ⋮ A combination of testability and decodability by tensor products

This page was built for publication: Locally Testable vs. Locally Decodable Codes