Combinatorial Limitations of Average-Radius List-Decoding

We study certain combinatorial aspects of listdecoding, motivated by the exponential gap between the known upper bound (of O(1/γ)) and lower bound (of Ω p (log(1/γ))) for the list size needed to list decode up to error fraction p with rate γ away from capacity, i.e., 1 - h(p) - γ [here p E (0, 1/2)...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	IEEE transactions on information theory Jg. 60; H. 10; S. 5827 - 5842
Hauptverfasser:	Guruswami, Venkatesan, Narayanan, Srivatsan
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	New York IEEE 01.10.2014 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Schlagworte:	Binary codes Coding theory Decoding Electronics Entropy Hamming distance Linear codes Points Upper bound Weight Combinatorial coding theory list error-correction linear codes random coding probabilistic method
ISSN:	0018-9448, 1557-9654
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!