Improved decoding of affine-variety codes
arXiv:1102.4186 · doi:10.1016/j.jpaa.2012.01.002
Abstract
General error locator polynomials are polynomials able to decode any correctable syndrome for a given linear code. Such polynomials are known to exist for all cyclic codes and for a large class of linear codes. We provide some decoding techniques for affine-variety codes using some multidimensional extensions of general error locator polynomials. We prove the existence of such polynomials for any correctable affine-variety code and hence for any linear code. We propose two main different approaches, that depend on the underlying geometry. We compute some interesting cases, including Hermitian codes. To prove our coding theory results, we develop a theory for special classes of zero-dimensional ideals, that can be considered generalizations of stratified ideals. Our improvement with respect to stratified ideals is twofold: we generalize from one variable to many variables and we introduce points with multiplicities.
Cited by in corpus (6)
- Stabilizer quantum codes from -affine variety codes and a new Steane-like enlargement
- New binary and ternary LCD codes
- Lemma for Linear Feedback Shift Registers and DFTs Applied to Affine Variety Codes
- Minimum-weight codewords of the Hermitian codes are supported on complete intersections
- Hermitian codes and complete intersections
- On the Hermitian curve, its intersections with some conics and their applications to affine-variety codes and Hermitian codes