Name
Abstract | ||
|---|---|---|
This paper is concerned with three ensembles of systematic low density generator matrix (LDGM) codes, all of which were provably capacity-achieving in terms of bit error rate (BER). This, however, does not necessarily imply that they achieve the capacity in terms of frame error rate (FER), as seen from a counterexample constructed in this paper. We then show that the first and second ensembles are capacity-achieving under list decoding over binary-input output symmetric (BIOS) memoryless channels. We point out that, in principle, the equivocation due to list decoding can be removed with negligible rate loss by the use of the concatenated codes. Simulation results show that the considered convolutional (spatially-coupled) LDGM code is capacity-approaching with an iterative belief propagation decoding algorithm. |
Year | DOI | Venue |
|---|---|---|
2018 | 10.1109/ITW.2018.8613510 | 2018 IEEE Information Theory Workshop (ITW) |
Keywords | Field | DocType |
capacity-achieving codes,coding theorem,concatenated code,list decoding,low density generator matrix (LDGM) codes,spatial coupling | Discrete mathematics,Concatenated error correction code,Computer science,Algorithm,Communication channel,Equivocation,Decoding methods,Counterexample,List decoding,Sparse matrix,Bit error rate | Conference |
ISSN | ISBN | Citations |
2475-420X | 978-1-5386-3600-8 | 0 |
PageRank | References | Authors |
0.34 | 0 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Wenchao Lin | 1 | 1 | 2.39 |
| Suihua Cai | 2 | 1 | 1.71 |
| Baodian Wei | 3 | 147 | 21.12 |
| Xiao Ma | 4 | 487 | 64.77 |