Title | ||
---|---|---|
Channels with both random errors and burst erasures: Capacities, LDPC code thresholds, and code performances |
Abstract | ||
---|---|---|
We derive the capacities of a class of channels, either memoryless or indecomposable finite-state, that also suffer from bursts of erasures. For such channels, we analyze the performances of low-density parity-check (LDPC) codes and code ensembles under belief propagation (BP) decoding, using density evolution (DE) techniques. Although known LDPC codes perform well in non-erasure-affected channels, their performances are far from the capacities when both random errors and erasures are present. We show that enhancing the codes' erasure handling using published methods beats, in some instances, the BP thresholds. However, to achieve capacity, codes must be constructed to tackle both effects simultaneously. |
Year | DOI | Venue |
---|---|---|
2010 | 10.1109/ISIT.2010.5513593 | ISIT |
Keywords | Field | DocType |
ldpc code threshold,low density parity check code,bp threshold,density evolution technique,random error,code performance,belief propagation decoding,parity check codes,decoding,channel capacity,ldpc code,belief propagation,construction industry,memory,noise,low density parity check | Random error,Computer science,Low-density parity-check code,Algorithm,Communication channel,Decoding methods,Tornado code,Channel capacity,Belief propagation,Erasure | Conference |
ISBN | Citations | PageRank |
978-1-4244-7891-0 | 1 | 0.35 |
References | Authors | |
8 | 4 |
Name | Order | Citations | PageRank |
---|---|---|---|
Kan Li | 1 | 55 | 14.93 |
Aleksandar Kavcic | 2 | 191 | 20.83 |
Raman Venkataramani | 3 | 31 | 9.58 |
M. Fatih Erden | 4 | 65 | 8.49 |