An efficient maximum-likelihood decoding of LDPC codes over the binary erasure channel

David Burshtein; Gadi Miller

doi:10.1109/TIT.2004.836694

An efficient maximum-likelihood decoding of LDPC codes over the binary erasure channel

David Burshtein^*, Gadi Miller

^*Corresponding author for this work

School of Electrical Engineering

Algotec Systems, Inc

Research output: Contribution to journal › Article › peer-review

75 Scopus citations

Abstract

We propose an efficient maximum-likelihood (ML) decoding algorithm for decoding low-density parity-check (LDPC) codes over the binary-erasure channel (BEC). We also analyze the computational complexity of the proposed algorithm.

Original language	English
Pages (from-to)	2837-2844
Number of pages	8
Journal	IEEE Transactions on Information Theory
Volume	50
Issue number	11
DOIs	https://doi.org/10.1109/TIT.2004.836694
State	Published - Nov 2004

Access to Document

10.1109/TIT.2004.836694

Cite this

@article{c03cadf11dd343ecaf9f117b0ed0d664,

title = "An efficient maximum-likelihood decoding of LDPC codes over the binary erasure channel",

abstract = "We propose an efficient maximum-likelihood (ML) decoding algorithm for decoding low-density parity-check (LDPC) codes over the binary-erasure channel (BEC). We also analyze the computational complexity of the proposed algorithm.",

author = "David Burshtein and Gadi Miller",

year = "2004",

month = nov,

doi = "10.1109/TIT.2004.836694",

language = "אנגלית",

volume = "50",

pages = "2837--2844",

journal = "IEEE Transactions on Information Theory",

issn = "0018-9448",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

number = "11",

}

TY - JOUR

T1 - An efficient maximum-likelihood decoding of LDPC codes over the binary erasure channel

AU - Burshtein, David

AU - Miller, Gadi

PY - 2004/11

Y1 - 2004/11

N2 - We propose an efficient maximum-likelihood (ML) decoding algorithm for decoding low-density parity-check (LDPC) codes over the binary-erasure channel (BEC). We also analyze the computational complexity of the proposed algorithm.

AB - We propose an efficient maximum-likelihood (ML) decoding algorithm for decoding low-density parity-check (LDPC) codes over the binary-erasure channel (BEC). We also analyze the computational complexity of the proposed algorithm.

UR - http://www.scopus.com/inward/record.url?scp=8144229470&partnerID=8YFLogxK

U2 - 10.1109/TIT.2004.836694

DO - 10.1109/TIT.2004.836694

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:8144229470

SN - 0018-9448

VL - 50

SP - 2837

EP - 2844

JO - IEEE Transactions on Information Theory

JF - IEEE Transactions on Information Theory

IS - 11

ER -

An efficient maximum-likelihood decoding of LDPC codes over the binary erasure channel

Abstract

Access to Document

Other files and links

Fingerprint

Cite this