Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

11

AAECC
2007
Springer

favoriteEmaildiscussreport

113views Algorithms» more AAECC 2007»

Generalized Sudan's List Decoding for Order Domain Codes

13 years 10 months ago

Generalized Sudan's List Decoding for Order Domain Codes

Download www.rmatsumoto.org

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.

Olav Geil, Ryutaroh Matsumoto

Real-time Traffic

AAECC 2007 | Algorithms | Arbitrary Order Domains | Correctable Errors | Evaluation Codes |

claim paper

Related Content

» Efficient Factorisation Algorithm for List Decoding AlgebraicGeometric and ReedSolomon Cod...

» List Decoding Techniques for Intersymbol Interference Channels Using Ordered Statistics

» Performance Analysis of Algebraic SoftDecision Decoding of ReedSolomon Codes

» Artin automorphisms cyclotomic function fields and folded listdecodable codes

» An adaptive ReedSolomon errorsanderasures decoder

» Power reduction via macroblock prioritization for power aware H264 video applications

» Local Monotonicity Reconstruction

Post Info
More Details (n/a)

Added	06 Jun 2010
Updated	06 Jun 2010
Type	Conference
Year	2007
Where	AAECC
Authors	Olav Geil, Ryutaroh Matsumoto

Comments (0)