Sub-Quadratic Decoding of One-Point Hermitian Codes

We present the first two sub-quadratic complexity decoding algorithms for one-point Hermitian codes. The first is based on a fast realization of the Guruswami-Sudan algorithm using state-of-the-art algorithms from computer algebra for polynomial-ring matrix minimization. The second is a power decodi...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	IEEE transactions on information theory Ročník 61; číslo 6; s. 3225 - 3240
Hlavní autori:	Nielsen, Johan S. R., Beelen, Peter
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	New York IEEE 01.06.2015 The Institute of Electrical and Electronics Engineers, Inc. (IEEE) Institute of Electrical and Electronics Engineers
Predmet:	AG codes Algebra Algorithms Coding theory Complexity theory Computer Science Decoding Electronics Guruswami-Sudan Hermitian codes Indexes Information Theory Interpolation list decoding Minimization Polynomials Power decoding power decoding Guruswami–Sudan Hermitian codes AG codes list decoding Power decoding Guruswami-Sudan
ISSN:	0018-9448, 1557-9654
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!