Succinct Representation of Codes with Applications to Testing

  • Authors:

  • Elena Grigorescu;Tali Kaufman;Madhu Sudan

  • Affiliations:

  • MIT, Cambridge, USA;MIT, Cambridge, USA;Microsoft Research, Cambridge, USA

  • Venue:
  • APPROX '09 / RANDOM '09 Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

Motivated by questions in property testing, we search for linear error-correcting codes that have the "single local orbit" property: 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 for prime n , and whose symmetry group includes the group of non-singular affine transformations of , has the single local orbit property. (A code is sparse if it contains polynomially many codewords in its block length.) In particular this class includes the dual-BCH codes for whose duals (BCH codes) simple bases were not known. Our result gives the first short (O (n )-bit, as opposed to $\exp(n)$-bit) description of a low-weight basis for BCH codes. If 2 n *** 1 is a Mersenne prime, then we get that every sparse cyclic code also has the single local orbit.