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&...
Gespeichert in:
| Veröffentlicht in: | SIAM journal on discrete mathematics Jg. 26; H. 4; S. 1618 - 1634 |
|---|---|
| Hauptverfasser: | , , |
| Format: | Journal Article |
| Sprache: | Englisch |
| Veröffentlicht: |
Philadelphia
Society for Industrial and Applied Mathematics
01.01.2012
|
| Schlagworte: | |
| ISSN: | 0895-4801, 1095-7146 |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| Zusammenfassung: | 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 whose coordinates are indexed by elements of $\mathbb{F}_{2^n}$ for prime $n$ and whose symmetry group includes the group of nonsingular affine transformations of $\mathbb{F}_{2^n}$ has the single local orbit property. (A code is said to be sparse if it contains polynomially many codewords in its block length.) In particular this class includes the dual-BCH codes for whose duals (i.e., for BCH codes) simple bases were not known. Our result gives the first short ($O(n)$-bit, as opposed to the natural $\exp(n)$-bit) description of a low-weight basis for BCH codes. The interest in the single local orbit property comes from the recent result of Kaufman and Sudan (STOC 2008) that shows that the duals of codes that have the single local orbit property under the affine symmetry group are locally testable. When combined with our main result, this shows that all sparse affine-invariant codes over the coordinates $\mathbb{F}_{2^n}$ for prime $n$ are locally testable. If, in addition to $n$ being prime, $2^n-1$ does not have large divisors, then we get that every sparse cyclic-invariant code also has the single local orbit. In particular this implies that BCH codes of such length are generated by a single low-weight codeword and its cyclic shifts. [PUBLICATION ABSTRACT] |
|---|---|
| Bibliographie: | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14 |
| ISSN: | 0895-4801 1095-7146 |
| DOI: | 10.1137/100818364 |