Succinct Representation of Codes with Applications to Testing
Motivated by questions in property testing, we search for linear error-correcting codes that have the “single local orbit” property: i.e., they are specified by a single local constraint and its translations under the symmetry group of the code. We show that the dual of every “sparse” binary code...
Main Authors: | Sudan, Madhu, Kaufman-Halman, Tali, Grigorescu, Elena |
---|---|
Other Authors: | Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory |
Format: | Article |
Language: | en_US |
Published: |
Springer Berlin
2010
|
Online Access: | http://hdl.handle.net/1721.1/55959 |
Similar Items
-
Locally Testable Codes Require Redundant Testers
by: Viderman, Michael, et al.
Published: (2010) -
Breaking the epsilon-Soundness Bound of the Linearity Test over Gf(2)
by: Kaufman-Halman, Tali, et al.
Published: (2010) -
Algorithmic issues in coding theory
by: Sudan, Madhu
Published: (2023) -
Decoding Reed Solomon Codes beyond the Error-Correction Diameter
by: Sudan, Madhu
Published: (2023) -
Succinct non-subsequence arguments
by: Ling, San, et al.
Published: (2024)