Groebner bases and distance of cyclic codes

Applicable Algebra in Engineering, Communications and Computing

Volumn 13, Issue 2, 2002, Pages 137-162

  Sala, Massimiliano ^a  

^a UNIVERSITY OF PISA   (Italy)

Author keywords

Cyclic codes; Distance; Gr bner bases

Indexed keywords

ALGORITHMS; CALCULATIONS; CODES (SYMBOLS); COMPUTATIONAL COMPLEXITY; DECODING; DISCRETE FOURIER TRANSFORMS; ERROR CORRECTION; MATRIX ALGEBRA; SET THEORY; THEOREM PROVING; VECTORS;

CYCLIC CODES; GOLAY CODE; GROEBNER BASES;

POLYNOMIALS;

EID: 0036602305     PISSN: 09381279     EISSN: None     Source Type: Journal    
DOI: 10.1007/s002000200096     Document Type: Article

References (34)

1. Newton's identities for minimum codewords of a family of alternant codes
2. Bounds on the minimum distance of the duals of BCH codes
3. A divide and conquer algorithm for Hilbert-Poincaré series, multiplicity and dimension of monomial ideals
4. The Chen-Reed-Helleseth-Truong decoding algorithm and the Gianni-Kalkbrenner Gröbner shape theorem
5. A new algorithm for finding minimum-weight words in a linear code: Application to McEliece's cryptosystem and to narrow-sense BCH codes of length 511
6. Bounds for exponential sums
7. Use of Gröbner bases to decode binary cyclic codes up to the true minimum distance
8. Algebraic decoding of cyclic codes: A polynomial ideal point of view
9. Direct solution of BCH decoding equations
10. Finding BCH error locator polynomials in one step
11. On the key equation
12. Properties of Gröbner bases under specialization
13. Improved asymptotic bounds for error-connecting codes
14. Solving systems of algebraic equations using Gröbner bases
15. An approximation to the weight distribution of binary linear codes
16. On the distance distribution of duals of BCH codes
17. On upper bounds for minimum distance and covering radius for non-binary codes
18. Bounds on the minimum distance of the duals of extended BCH codes over Fp
19. On the decoding of cyclic codes using Gröbner bases
20. On the Gröbner bases of some symmetric systems
21. The MacWilliams-Sloane conjecture on the tightness of the Carlitz-Uchiyama bound and the weights of duals of BCH codes
22. Binary codes with specified minimum distance
23. A linear programming estimate of the weight distribution of BCH(255, k)
24. A lower bound on the distance of cyclic codes
25. Upper bounds on the dual distance of BCH (255, k)
26. Gröbner bases, accelerator polynomials and binary cyclic codes with coincident distances
27. On some algebraic methods in the theory of error correcting codes