General Error Locator Polynomials for Binary Cyclic Codes With and

Authors:
Emmanuela Orsini;Massimiliano Sala
Affiliations:
Dipt. di Matematica, Milan Univ.;-
Venue:
IEEE Transactions on Information Theory
Year:
2007

Citing 0
Cited 5

Invited Talk: Decoding Cyclic Codes: The Cooper Philosophy

Mathematical Methods in Computer Science
On the decoding of binary cyclic codes with the Newton identities

Journal of Symbolic Computation
Algebraic decoding of a class of binary cyclic codes via Lagrange interpolation formula

IEEE Transactions on Information Theory
Unusual general error locator polynomial for the (23, 12, 7) golay Code

IEEE Communications Letters
Decoding binary cyclic codes with irreducible generator polynomials up to actual minimum distance

IEEE Communications Letters

Quantified Score

Hi-index	754.90

Visualization

Abstract

In this paper, we show that a recently proposed algorithm for decoding cyclic codes may be applied efficiently to all binary cyclic codes with tles2 and n<63. This is accomplished by providing structure theorems for the codes in this range and classifying the relevant cases