Generalized Sudan's List Decoding for Order Domain Codes

Hans Olav Geil, Ryutaroh Matsumoto

Research output: Contribution to book/anthology/report/conference proceedingBook chapterResearch

3 Citations (Scopus)

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.
Original languageEnglish
Title of host publicationApplied Algebra, Algebraic Algorithms and Error-Correcting Codes : 17th International Symposium, AAECC-17, Bangalore, India, December 16-20, 2007. Proceedings
EditorsSerdar Boztas, Hsiao-feng Lu
Number of pages10
PublisherSpringer
Publication date2007
Pages50-59
ISBN (Print)9783540772231
Publication statusPublished - 2007
SeriesLecture Notes in Computer Science
Number4851
ISSN0302-9743

Cite this