Explicit low-weight bases for BCH codes

IEEE Transactions on Information Theory

Volumn 58, Issue 1, 2012, Pages 78-81

  Grigorescu, Elena ^a   Kaufman, Tali ^b,c  

^a GEORGIA INSTITUTE OF TECHNOLOGY   (United States)

^b BAR ILAN UNIVERSITY   (Israel)

^c WEIZMANN INSTITUTE OF SCIENCE   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

AFFINE GROUPS; AFFINE TRANSFORMATIONS; BCH CODE; CODE-WORDS; CODEWORD; LOW WEIGHT; PROPERTY-TESTING; SMALL WEIGHT CODEWORDS;

COMPUTER APPLICATIONS; INFORMATION THEORY;

CODES (SYMBOLS);

EID: 84855669288     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIT.2011.2167739     Document Type: Article

References (10)

1. E. Ben-Sasson, E. Grigorescu, G. Maatouk, A. Shpilka, and M. Sudan, "On sums of locally testable affine invariant properties," APPROXRANDOM, pp. 400-411, 2011.
2. P. Delsarte, "The association schemes of coding theory," Combinatorics, pp. 143-161, 1975.
3. E. Grigorescu, "Symmetries in Algebraic Property Testing," Ph.D. dissertation, Mass. Inst. Technol., Cambridge, 2010.
4. E. Grigorescu, T. Kaufman, and M. Sudan, "2-transitivity is insufficient for local testability," CCC, pp. 259-267, 2008, IEEE Comput. Soc.
5. E. Grigorescu, T. Kaufman, and M. Sudan, "Succinct representation of codes with applications to testing," APPROX-RANDOM, pp. 534-547, 2009.
6. T. Kaufman and S. Litsyn, "Almost orthogonal linear codes are locally testable," FOCS, pp. 317-326, 2005, IEEE Comput. Soc.. (Pubitemid 44375742)
7. T. Kaufman and S. Lovett, "New extension of theWeil bound for character sums with applications to coding," FOCS, 2011.
8. T. Kaufman and M. Sudan, "Algebraic property testing: The role of invariance," STOC, pp. 403-412, 2008.
9. J. M. Florence and J. A. S. Neil, The Theory of Error-Correcting Codes. Amsterdam, The Netherlands: Elsevier/North-Holland, 1981.
10. R. E. A. C. Paley, "Theorems on polynomials in a Galois field," Q. J. Math, vol. Os-4, no. 1, pp. 52-63, 1933.