Back to Search
Start Over
Generalized Sudan's List Decoding for Order Domain Codes
- Source :
- Geil, H O & Matsumoto, R 2007, Generalized Sudan's List Decoding for Order Domain Codes . in S Boztas & H Lu (eds), Applied Algebra, Algebraic Algorithms and Error-Correcting Codes : 17th International Symposium, AAECC-17, Bangalore, India, December 16-20, 2007. Proceedings . Springer, Lecture Notes in Computer Science, no. 4851, pp. 50-59 . < http://www.springerlink.com/content/14302814h1215777/?p=1b3353a3ce3443a0976eff43574c4ed3&pi=8 >
- Publication Year :
- 2007
- Publisher :
- Springer, 2007.
-
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.
- Subjects :
- Data_CODINGANDINFORMATIONTHEORY
Computer Science::Information Theory
Subjects
Details
- Language :
- English
- Database :
- OpenAIRE
- Journal :
- Geil, H O & Matsumoto, R 2007, Generalized Sudan's List Decoding for Order Domain Codes . in S Boztas & H Lu (eds), Applied Algebra, Algebraic Algorithms and Error-Correcting Codes : 17th International Symposium, AAECC-17, Bangalore, India, December 16-20, 2007. Proceedings . Springer, Lecture Notes in Computer Science, no. 4851, pp. 50-59 . < http://www.springerlink.com/content/14302814h1215777/?p=1b3353a3ce3443a0976eff43574c4ed3&pi=8 >
- Accession number :
- edsair.dedup.wf.001..da17e2f2be8cff08cdce985cfa8eaba5