Some Recent Results on Local Testing of Sparse Linear Codes

DOI10.1007/978-3-642-16367-8_26zbMath1309.68225OpenAlexW1904286506MaRDI QIDQ4933384

Swastik Kopparty, Shubhangi Saraf

Publication date: 12 October 2010

Published in: Property Testing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-16367-8_26

zbMATH Keywords

error-correcting codesrandom codeslist-decoding

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Randomized algorithms (68W20) Decoding (94B35)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Self-testing/correcting with applications to numerical problems
• PAC learning with nasty noise.
• Improved low-degree testing and its applications
• Tolerant property testing and distance approximation
• Learning Polynomials with Queries: The Highly Noisy Case
• Pseudorandom generators without the XOR Lemma (extended abstract)
• Sub-constant error low degree test of almost-linear size
• Linearity testing in characteristic two
• Property testing and its connection to learning and approximation
• Tolerant Linearity Testing and Locally Testable Codes
• On spectra of BCH codes
• Robust Characterizations of Polynomials with Applications to Program Testing
• New direct-product testers and 2-query PCPs
• Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques
• Noise-tolerant learning, the parity problem, and the statistical query model

This page was built for publication: Some Recent Results on Local Testing of Sparse Linear Codes