251 search results - page 9 / 51 » Channel Coding: The Road to Channel Capacity |
CORR
2007
Springer
14 years 11 months ago
2007
Springer
— In this work, we study the problem of evaluating the performance limit of two communication problems that are closely related to each other- source coding with feed-forward and...
89
Voted
GLOBECOM
2008
IEEE
14 years 12 months ago
2008
IEEE
In this paper, we investigate upper and lower bounds on the capacity of two-user fading broadcast channels where one of the users has a constant (non-fading) channel. We use the Co...
125
click to vote
TIT
2010
14 years 6 months ago
2010
We directly lower bound the information capacity for channels with i.i.d. deletions and duplications. Our approach differs from previous work in that we focus on the information ca...
109
click to vote
CORR
2010
Springer
14 years 10 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...
GLOBECOM
2010
IEEE
14 years 9 months ago
2010
IEEE
1 Shannon's channel capacity specifies the upper bound on the amount of bits per channel use. In this paper, we explicitly demonstrate that twin-component turbo codes suffer f...