CORR
2010
Springer
13 years 11 months ago
2010
Springer
— 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...
CORR
2008
Springer
14 years 16 days ago
2008
Springer
Random coding arguments are the backbone of most channel capacity achievability proofs. In this paper, we show that in their standard form, such arguments are insufficient for pro...