Sciweavers

13 search results - page 2 / 3
» Capacity-achieving sequences for the erasure channel
Sort
View
CORR
2004
Springer
115views Education» more  CORR 2004»
13 years 5 months ago
Bounds on the decoding complexity of punctured codes on graphs
We present two sequences of ensembles of non-systematic irregular repeat-accumulate codes which asymptotically (as their block length tends to infinity) achieve capacity on the bi...
Henry D. Pfister, Igal Sason, Rüdiger L. Urba...
CORR
2006
Springer
141views Education» more  CORR 2006»
13 years 5 months ago
Iterative Decoding Performance Bounds for LDPC Codes on Noisy Channels
The asymptotic iterative decoding performances of low-density parity-check (LDPC) codes using min-sum (MS) and sum-product (SP) decoding algorithms on memoryless binary-input outp...
Chun-Hao Hsu, Achilleas Anastasopoulos
CORR
2007
Springer
108views Education» more  CORR 2007»
13 years 5 months ago
Limited feedback achieves the empirical capacity
The utility of limited feedback for coding over an individual sequence of DMCs is investigated. This study complements recent results showing how limited or noisy feedback can boo...
Krishnan Eswaran, Anand D. Sarwate, Anant Sahai, M...
DCC
2006
IEEE
14 years 5 months ago
Joint Source-Channel Decoding of Multiple Description Quantized Markov Sequences
This paper proposes a framework for joint source-channel decoding of Markov sequences that are coded by a fixed-rate multiple description quantizer (MDQ), and transmitted via a lo...
Xiaolin Wu, Xiaohan Wang
TIT
2008
68views more  TIT 2008»
13 years 5 months ago
Signaling Over Arbitrarily Permuted Parallel Channels
The problem of transmission of information over arbitrarily permuted parallel channels is studied here. The transmitter does not know over which channel a certain codesequence will...
Frans M. J. Willems, Alexei Gorokhov