Sciweavers

160 search results - page 2 / 32
» On the List-Decodability of Random Linear Codes
Sort
View
TIT
2008
127views more  TIT 2008»
14 years 9 months ago
List Decoding of Biorthogonal Codes and the Hadamard Transform With Linear Complexity
Let a biorthogonal Reed
Ilya Dumer, Gregory A. Kabatiansky, Cédric ...
93
Voted
TIT
2002
129views more  TIT 2002»
14 years 9 months ago
Combinatorial bounds for list decoding
Abstract--Informally, an error-correcting code has "nice" listdecodability properties if every Hamming ball of "large" radius has a "small" number of ...
Venkatesan Guruswami, Johan Håstad, Madhu Su...
CORR
2010
Springer
148views Education» more  CORR 2010»
14 years 8 months ago
List decoding for nested lattices and applications to relay channels
— We demonstrate a decoding scheme for nested lattice codes which is able to decode a list of a particular size which contains the transmitted codeword with high probability. Thi...
Yiwei Song, Natasha Devroye
CORR
2008
Springer
110views Education» more  CORR 2008»
14 years 9 months ago
A Neyman-Pearson Approach to Universal Erasure and List Decoding
When information is to be transmitted over an unknown, possibly unreliable channel, an erasure option at the decoder is desirable. Using constant-composition random codes, we propo...
Pierre Moulin
STOC
2009
ACM
161views Algorithms» more  STOC 2009»
15 years 10 months ago
List decoding tensor products and interleaved codes
We design the first efficient algorithms and prove new combinatorial bounds for list decoding tensor products of codes and interleaved codes. ? We show that for every code, the rat...
Parikshit Gopalan, Venkatesan Guruswami, Prasad Ra...