A finite-length algorithm for LDPC codes without repeated edges on the binary erasure channel

Johnson, Sarah J.

Open link

Publication date

January 2009

DOI

10.1109/TIT.2008.2008118

Publisher

Institute of Electrical and Electronics Engineers (IEEE)

ISSN

0018-9448

Journal

ISSN:0018-9448

Abstract

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

Extracted data

We use cookies to provide a better user experience.

Data Protection

A finite-length algorithm for LDPC codes without repeated edges on the binary erasure channel

Abstract

Extracted data

A finite-length algorithm for LDPC codes without repeated edges on the binary erasure channel

Abstract

Extracted data

Related items

Related items