Finite-length analysis of LDPC codes with large left degrees

Junan Zhang, Alon Orlitsky

Research output: Chapter in Book/Report/Conference proceedingConference contribution

21 Citations (Scopus)

Abstract

Finite length analysis of low-density parity-check (LDPC) codes with large left degrees was discussed. Recursions for maximum stopping sets were calculated and used for calculating the (average) block- and bit- error probability for regular-degree LDPC codes. The block error probability was related to the code's lowest left degree.

Original languageEnglish (US)
Title of host publicationIEEE International Symposium on Information Theory - Proceedings
Pages3
Number of pages1
StatePublished - 2002
Externally publishedYes
Event2002 IEEE International Symposium on Information Theory - Lausanne, Switzerland
Duration: Jun 30 2002Jul 5 2002

Other

Other2002 IEEE International Symposium on Information Theory
CountrySwitzerland
CityLausanne
Period6/30/027/5/02

Fingerprint

Error probability

ASJC Scopus subject areas

  • Electrical and Electronic Engineering

Cite this

Zhang, J., & Orlitsky, A. (2002). Finite-length analysis of LDPC codes with large left degrees. In IEEE International Symposium on Information Theory - Proceedings (pp. 3)

Finite-length analysis of LDPC codes with large left degrees. / Zhang, Junan; Orlitsky, Alon.

IEEE International Symposium on Information Theory - Proceedings. 2002. p. 3.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Zhang, J & Orlitsky, A 2002, Finite-length analysis of LDPC codes with large left degrees. in IEEE International Symposium on Information Theory - Proceedings. pp. 3, 2002 IEEE International Symposium on Information Theory, Lausanne, Switzerland, 6/30/02.
Zhang J, Orlitsky A. Finite-length analysis of LDPC codes with large left degrees. In IEEE International Symposium on Information Theory - Proceedings. 2002. p. 3
Zhang, Junan ; Orlitsky, Alon. / Finite-length analysis of LDPC codes with large left degrees. IEEE International Symposium on Information Theory - Proceedings. 2002. pp. 3
@inproceedings{8ff3f03273094c45833207cefcd48387,
title = "Finite-length analysis of LDPC codes with large left degrees",
abstract = "Finite length analysis of low-density parity-check (LDPC) codes with large left degrees was discussed. Recursions for maximum stopping sets were calculated and used for calculating the (average) block- and bit- error probability for regular-degree LDPC codes. The block error probability was related to the code's lowest left degree.",
author = "Junan Zhang and Alon Orlitsky",
year = "2002",
language = "English (US)",
pages = "3",
booktitle = "IEEE International Symposium on Information Theory - Proceedings",

}

TY - GEN

T1 - Finite-length analysis of LDPC codes with large left degrees

AU - Zhang, Junan

AU - Orlitsky, Alon

PY - 2002

Y1 - 2002

N2 - Finite length analysis of low-density parity-check (LDPC) codes with large left degrees was discussed. Recursions for maximum stopping sets were calculated and used for calculating the (average) block- and bit- error probability for regular-degree LDPC codes. The block error probability was related to the code's lowest left degree.

AB - Finite length analysis of low-density parity-check (LDPC) codes with large left degrees was discussed. Recursions for maximum stopping sets were calculated and used for calculating the (average) block- and bit- error probability for regular-degree LDPC codes. The block error probability was related to the code's lowest left degree.

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

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

M3 - Conference contribution

AN - SCOPUS:0036352495

SP - 3

BT - IEEE International Symposium on Information Theory - Proceedings

ER -