A Correction to "Some Gabidulin Codes Cannot be List Decoded Efficiently at any Radius"

A Correction to "Some Gabidulin Codes Cannot be List Decoded Efficiently at any Radius"

There is an error in the above titled paper [1] . As a result, the main statement of the paper is true for a subset of the Gabidulin codes for which it was initially stated. To be precise, our results on the list decodability still hold for the same parameters of n and m , but the evaluation poin...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:IEEE transactions on information theory 2017-04, Vol.63 (4), p.2623-2624
Hauptverfasser: Raviv, Netanel, Wachter-Zeh, Antonia
Format: Artikel
Sprache:eng
Schlagworte:
Computer science
Decoding
Encoding
Europe
Gabidulin codes
Indexes
list decoding
Rank-metric codes
subspace codes
subspace polynomials
Technological innovation
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:There is an error in the above titled paper [1] . As a result, the main statement of the paper is true for a subset of the Gabidulin codes for which it was initially stated. To be precise, our results on the list decodability still hold for the same parameters of n and m , but the evaluation points have to be of a certain structure.
ISSN:0018-9448
1557-9654
DOI:10.1109/TIT.2017.2659766