Succinct representation of codes with applications to testing

DOI10.1137/100818364MaRDI QIDQ4915191zbMATH OpenOpenAlexFDO

Authors Elena Grigorescu, Tali Kaufman, Madhu Sudan

Publication date 9 April 2013

Published in SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL http://hdl.handle.net/1721.1/55959

zbMATH Keywords

affine invarianceBCH codescyclic invariancelocally testable codessingle orbit

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Linear codes (general theory) (94B05)

Recommendations

• Succinct Representation of Codes with Applications to Testing
• Some recent results on local testing of sparse linear codes
• Sparse affine-invariant linear codes are locally testable
• Locally Testable Cyclic Codes
• Low Rate Is Insufficient for Local Testability

Cited in

(5)

• 2-transitivity is insufficient for local testability
• Succinct Representation of Codes with Applications to Testing
• A unified framework for testing linear-invariant properties
• Explicit strong LTCs with inverse poly-log rate and constant soundness
• Algorithms for the diverse-k-SAT problem: the geometry of satisfying assignments

This page was built for publication: Succinct representation of codes with applications to testing

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