Decoding Affine Variety Codes Using Gröbner Bases
Designs, Codes and Cryptography
Bounded distance decoding of linear error-correcting codes with Gröbner bases
Journal of Symbolic Computation
On the decoding of binary cyclic codes with the Newton identities
Journal of Symbolic Computation
Hi-index | 754.84 |
This paper provides two theorems for decoding all types of cyclic codes. It is shown that from a polynomial ideal point of view, the decoding problems of cyclic codes are closely related to the monic generators of certain polynomial ideals. This conclusion is also generalized to the decoding problems of algebraic geometry codes.