Generalized Sudan's list decoding for order domain codes

Authors:
Olav Geil;Ryutaroh Matsumoto
Affiliations:
Department of Mathematical Sciences, Aalborg University, Denmark;Department of Communications and Integrated Systems, Tokyo Institute of Technology, Japan
Venue:
AAECC'07 Proceedings of the 17th international conference on Applied algebra, algebraic algorithms and error-correcting codes
Year:
2007

Citing 8
Cited 2

Decoding of Reed Solomon codes beyond the error-correction bound

Journal of Complexity
List decoding of algebraic-geometric codes

IEEE Transactions on Information Theory
Improved decoding of Reed-Solomon and algebraic-geometry codes

IEEE Transactions on Information Theory
List decoding of q-ary Reed-Muller codes

IEEE Transactions on Information Theory
Evaluation codes from order domain theory

Finite Fields and Their Applications
On codes from norm-trace curves

Finite Fields and Their Applications
On the Structure of Order Domains

Finite Fields and Their Applications
New Codes for the Berlekamp-Massey-Sakata Algorithm: New Codes for the Berlekamp-Massey-Sakata Algorithm

Finite Fields and Their Applications

Weighted Reed---Muller codes revisited

Designs, Codes and Cryptography
Evaluation codes defined by finite families of plane valuations at infinity

Designs, Codes and Cryptography

Quantified Score

Hi-index	0.00

Visualization

Abstract

We generalize Sudan's list decoding algorithm without multiplicity to evaluation codes coming from arbitrary order domains. The number of correctable errors by the proposed method is larger than the original list decoding without multiplicity.