A finite-length algorithm for LDPC codes without repeated edges on the binary erasure channel | NOVA. The University of Newcastle's Digital Repository

Home

Please use this identifier to cite or link to this item: http://hdl.handle.net/1959.13/809180

Title: A finite-length algorithm for LDPC codes without repeated edges on the binary erasure channel
Author/Creator: Johnson, Sarah J.
Institution: The University of Newcastle. Faculty of Engineering & Built Environment, School of Electrical Engineering and Computer Science
Description: This paper considers the performance, on the binary erasure channel, of low-density parity-check (LDPC) codes without repeated edges in their Tanner graphs. A modification to existing finite-length analysis algorithms is presented for these codes.
Relation: IEEE Transactions on Information Theory Vol. 55, Issue 1, p. 27-32
Publisher Link: http://dx.doi.org/10.1109/TIT.2008.2008118
Date: 2009
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Keyword(s): binary erasure channels; finite-length analysis; iterative decoding; low-density parity-check (LDPC) codes; message-passing decoding
Resource Type: journal article
Identifier: http://hdl.handle.net/1959.13/809180
Identifier: ISSN:0018-9448

13 Visitors

16 Hits

NOVA. The University of Newcastle's Digital Repository