Generalized Sudan's List Decoding for Order Domain Codes

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.

• Type: Conference
• Year: 2007
• Where: AAECC
• Authors: Olav Geil, Ryutaroh Matsumoto
• Keywords: AAECC 2007, Algorithms, Arbitrary Order Domains, Correctable Errors, Evaluation Codes