Generalized Sudan’s List Decoding for Order Domain Codes

DOI10.1007/978-3-540-77224-8_9zbMath1195.94090OpenAlexW1544136829MaRDI QIDQ5386077

Ryutaroh Matsumoto, Olav Geil

Publication date: 17 April 2008

Published in: Applied Algebra, Algebraic Algorithms and Error-Correcting Codes (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-77224-8_9

Mathematics Subject Classification ID

Decoding (94B35) Arithmetic codes (94B40)

Related Items (2)

Weighted Reed-Muller codes revisited ⋮ Evaluation codes defined by finite families of plane valuations at infinity

Cites Work

• Unnamed Item
• On the structure of order domains
• Decoding of Reed Solomon codes beyond the error-correction bound
• On codes from norm-trace curves
• List Decoding of<tex>$q$</tex>-ary Reed–Muller Codes
• A Note on the Generalisation of the Guruswami–Sudan List Decoding Algorithm to Reed–Muller Codes
• Improved decoding of Reed-Solomon and algebraic-geometry codes
• List decoding of algebraic-geometric codes
• New codes for the Berlekamp-Massey-Sakata algorithm

This page was built for publication: Generalized Sudan’s List Decoding for Order Domain Codes