Decoding algebraic geometric codes

We present a new algorithm for decoding AG-codes significantly beyond the error-correction bound. Specifically, given a word y whose distance to the AG-code is at most e, where e is a parameter depending on the block length and the dimension of the code, our algorithm produces all codewords that hav...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Hauptverfasser:	Shokrollahi, M.A., Wasserman, H.
Format:	Tagungsbericht
Sprache:	eng
Schlagworte:	Algorithm design and analysis Binary codes Computer errors Computer science Concatenated codes Decoding Error correction codes Galois fields Hamming distance Reed-Solomon codes
Online-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Beschreibung
Zusammenfassung:	We present a new algorithm for decoding AG-codes significantly beyond the error-correction bound. Specifically, given a word y whose distance to the AG-code is at most e, where e is a parameter depending on the block length and the dimension of the code, our algorithm produces all codewords that have distance /spl les/e from y. We also discuss modifications of our general algorithm and show how to obtain similar algorithms for binary codes using concatenated codes.
DOI:	10.1109/ITW.1998.706403