22 search results - page 2 / 5 » Asymptotics of Input-Constrained Binary Symmetric Channel Ca... |
ICC
2007
IEEE
13 years 11 months ago
2007
IEEE
— Discrete input distributions are capacity-achieving for a variety of noise distributions whenever the input is subject to peak power or other bounding constraints. In this pape...
TIT
2010
13 years 3 days ago
2010
We consider lossy source compression of a binary symmetric source using polar codes and the low-complexity successive encoding algorithm. It was recently shown by Arikan that polar...
STOC
1994
ACM
13 years 9 months ago
1994
ACM
Shannon's Coding Theorem shows that in order to reliably transmit a message of T bits over a noisy communication channel, only a constant slowdown factor is necessary in the ...
DCC
2004
IEEE
14 years 5 months ago
2004
IEEE
We study the entropy rate of a hidden Markov process (HMP) defined by observing the output of a binary symmetric channel whose input is a first-order binary Markov process. Despit...
DAM
2006
13 years 5 months ago
2006
We consider bounded distance list decoding, such that the decoder calculates the list of all codewords within a sphere around the received vector. We analyze the performance and t...