13 search results - page 2 / 3 » Explicit Codes Achieving List Decoding Capacity: Error-Corre... |
STOC
2009
ACM
14 years 6 months ago
2009
ACM
Algebraic codes that achieve list decoding capacity were recently constructed by a careful "folding" of the Reed-Solomon code. The "low-degree" nature of this f...
DCC
2005
IEEE
14 years 5 months ago
2005
IEEE
Minimum-entropy decoding is a universal decoding algorithm used in decoding block compression of discrete memoryless sources as well as block transmission of information across di...
CORR
2010
Springer
13 years 3 months ago
2010
Springer
In this paper, we show that over the binary erasure channel, Quasi-Cyclic LDPC codes can efficiently accommodate the hybrid iterative/ML decoding. We demonstrate that the quasicycl...
TIT
2010
13 years 28 days ago
2010
We prove that binary linear concatenated codes with an outer algebraic code (specifically, a folded Reed-Solomon code) and independently and randomly chosen linear inner codes ach...
CORR
2008
Springer
13 years 6 months ago
2008
Springer
The classical problem of reliable point-to-point digital communication is to achieve a low probability of error while keeping the rate high and the total power consumption small. ...