Name
Abstract | ||
|---|---|---|
The tightened union bound on the block 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 the Hamming weight of the codewords that belong to the irreducible set. By utilizing the similar technique to the conventional sphere bound, we obtain a new tightened sphere bound. This approach is not only simpler than the conventional bound techniques in the sense of computation complexity, but it also extends the reliable region of Eb/N0 in which the bounds yields meaningful results. |
Year | DOI | Venue |
|---|---|---|
2004 | 10.1109/PIMRC.2004.1368788 | PIMRC |
Keywords | Field | DocType |
ldpc,tightened union bound,low density parity check codes,block error probability,block codes,computational complexity,hamming codes,expurgated sphere bound,error statistics,parity check codes,error probability,hamming weight | Discrete mathematics,Hamming code,Combinatorics,Hamming(7,4),Block code,Cyclic code,Hamming distance,Linear code,Hamming bound,Singleton bound,Mathematics | Conference |
Volume | ISBN | Citations |
4 | 0-7803-8523-3 | 0 |
PageRank | References | Authors |
0.34 | 5 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Vu-Duc Ngo | 1 | 39 | 8.39 |
| Haewook Choi | 2 | 28 | 7.23 |
| Sin-Chong Park | 3 | 80 | 22.58 |