Name
Abstract | ||
|---|---|---|
A tight bound on the bit error probability for low density parity check codes is derived by eliminating the useless codewords out of the union bound. The elimination of these codewords is done by applying Verdu's theorem and calculating tin Hamming weight of the codewords that belong to the irreducible set. This approach is simpler than other bound techniques in the sense of the complexity of computation and it also extends the reliable region of Eb/N0 in which the bound yields meaningful results. |
Year | DOI | Venue |
|---|---|---|
2003 | 10.1109/PIMRC.2003.1264306 | PIMRC |
Keywords | Field | DocType |
ldpc,verdu theorem,union bound,bit error probability,low density parity check codes,distance spectrum,codewords hamming weight,computational complexity,hamming codes,irreducible set,error statistics,parity check codes,spectrum,hamming weight | Discrete mathematics,Hamming code,Parity bit,Combinatorics,Low-density parity-check code,Hamming(7,4),Linear code,Hamming weight,Hamming bound,Mathematics,Singleton bound | Conference |
Volume | ISBN | Citations |
1 | 0-7803-7822-9 | 0 |
PageRank | References | Authors |
0.34 | 3 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Vu-Duc Ngo | 1 | 39 | 8.39 |
| Sin-Chong Park | 2 | 80 | 22.58 |