Stopping set distribution of LDPC code ensembles

Alon Orlitsky, Krishnamurthy Viswanathan, Junan Zhang

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

7 Citations (Scopus)

Abstract

An attempt was made to study the asymptotic behavior of two quantities: the distribution of stopping sets, and the stopping number sz.ast;-the size of the smallest nonempty stopping set in a code and use it to bound the error probability of LDPC codes with large blocklength. An expression for the normalized average stopping set distribution of regular and irregular LDPC codes was derived and used to obtain a critical fraction of the block length above which codes have exponentially many stopping sets of that size.

Original languageEnglish (US)
Title of host publicationIEEE International Symposium on Information Theory - Proceedings
Pages123
Number of pages1
StatePublished - 2003
Externally publishedYes
EventProceedings 2003 IEEE International Symposium on Information Theory (ISIT) - Yokohama, Japan
Duration: Jun 29 2003Jul 4 2003

Other

OtherProceedings 2003 IEEE International Symposium on Information Theory (ISIT)
CountryJapan
CityYokohama
Period6/29/037/4/03

Fingerprint

Error probability

ASJC Scopus subject areas

  • Electrical and Electronic Engineering

Cite this

Orlitsky, A., Viswanathan, K., & Zhang, J. (2003). Stopping set distribution of LDPC code ensembles. In IEEE International Symposium on Information Theory - Proceedings (pp. 123)

Stopping set distribution of LDPC code ensembles. / Orlitsky, Alon; Viswanathan, Krishnamurthy; Zhang, Junan.

IEEE International Symposium on Information Theory - Proceedings. 2003. p. 123.

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

Orlitsky, A, Viswanathan, K & Zhang, J 2003, Stopping set distribution of LDPC code ensembles. in IEEE International Symposium on Information Theory - Proceedings. pp. 123, Proceedings 2003 IEEE International Symposium on Information Theory (ISIT), Yokohama, Japan, 6/29/03.
Orlitsky A, Viswanathan K, Zhang J. Stopping set distribution of LDPC code ensembles. In IEEE International Symposium on Information Theory - Proceedings. 2003. p. 123
Orlitsky, Alon ; Viswanathan, Krishnamurthy ; Zhang, Junan. / Stopping set distribution of LDPC code ensembles. IEEE International Symposium on Information Theory - Proceedings. 2003. pp. 123
@inproceedings{49e484f7a7bc4eeba4b1df2565b33b3d,
title = "Stopping set distribution of LDPC code ensembles",
abstract = "An attempt was made to study the asymptotic behavior of two quantities: the distribution of stopping sets, and the stopping number sz.ast;-the size of the smallest nonempty stopping set in a code and use it to bound the error probability of LDPC codes with large blocklength. An expression for the normalized average stopping set distribution of regular and irregular LDPC codes was derived and used to obtain a critical fraction of the block length above which codes have exponentially many stopping sets of that size.",
author = "Alon Orlitsky and Krishnamurthy Viswanathan and Junan Zhang",
year = "2003",
language = "English (US)",
pages = "123",
booktitle = "IEEE International Symposium on Information Theory - Proceedings",

}

TY - GEN

T1 - Stopping set distribution of LDPC code ensembles

AU - Orlitsky, Alon

AU - Viswanathan, Krishnamurthy

AU - Zhang, Junan

PY - 2003

Y1 - 2003

N2 - An attempt was made to study the asymptotic behavior of two quantities: the distribution of stopping sets, and the stopping number sz.ast;-the size of the smallest nonempty stopping set in a code and use it to bound the error probability of LDPC codes with large blocklength. An expression for the normalized average stopping set distribution of regular and irregular LDPC codes was derived and used to obtain a critical fraction of the block length above which codes have exponentially many stopping sets of that size.

AB - An attempt was made to study the asymptotic behavior of two quantities: the distribution of stopping sets, and the stopping number sz.ast;-the size of the smallest nonempty stopping set in a code and use it to bound the error probability of LDPC codes with large blocklength. An expression for the normalized average stopping set distribution of regular and irregular LDPC codes was derived and used to obtain a critical fraction of the block length above which codes have exponentially many stopping sets of that size.

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

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

M3 - Conference contribution

AN - SCOPUS:0141904678

SP - 123

BT - IEEE International Symposium on Information Theory - Proceedings

ER -