NDLI: Stopping set distribution of LDPC code ensembles

Content Provider	IEEE Xplore Digital Library
Author	Orlitsky, A. Viswanathan, K. Zhang, J.
Copyright Year	1963
Abstract	Stopping sets determine the performance of low-density parity-check (LDPC) codes under iterative decoding over erasure channels. We derive several results on the asymptotic behavior of stopping sets in Tanner-graph ensembles, including the following. An expression for the normalized average stopping set distribution, yielding, in particular, a critical fraction of the block length above which codes have exponentially many stopping sets of that size. A relation between the degree distribution and the likely size of the smallest nonempty stopping set, showing that for a /spl radic/1-/spl lambda/'(0)/spl rho/'(1) fraction of codes with /spl lambda/'(0)/spl rho/'(1)<1, and in particular for almost all codes with smallest variable degree >2, the smallest nonempty stopping set is linear in the block length. Bounds on the average block error probability as a function of the erasure probability /spl epsi/, showing in particular that for codes with lowest variable degree 2, if /spl epsi/ is below a certain threshold, the asymptotic average block error probability is 1-/spl radic/1-/spl lambda/'(0)/spl rho/'(1)/spl epsi/.
Sponsorship	IEEE Information Theory Society
Starting Page	929
Ending Page	953
Page Count	25
File Size	681099
File Format	PDF
ISSN	00189448
Volume Number	51
Issue Number	3
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2005-03-01
Publisher Place	U.S.A.
Access Restriction	One Nation One Subscription (ONOS)
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Parity check codes Iterative decoding Error probability Iterative algorithms H infinity control Algorithm design and analysis Computer errors Information theory Computer science stopping set Binary erasure channel (BEC) block error probability growth rate low-density parity-check (LDPC) codes minimum distance
Content Type	Text
Resource Type	Article
Subject	Library and Information Sciences Information Systems Computer Science Applications

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Upper Bound on Error Exponent of Regular LDPC Codes Transmitted Over the BEC

An Efficient Algorithm to Find All Small-Size Stopping Sets of Low-Density Parity-Check Matrices

Capacity-achieving ensembles for the binary erasure channel with bounded complexity

Finite-Length Scaling for Iteratively Decoded LDPC Ensembles

Turbo Decoding on the Binary Erasure Channel: Finite-Length Analysis and Turbo Stopping Sets

New Sequences of Capacity Achieving LDPC Code Ensembles Over the Binary Erasure Channel

Bounds on the Number of Iterations for Turbo-Like Ensembles Over the Binary Erasure Channel

Weight Distribution of Low-Density Parity-Check Codes

Performance of low-density parity-check codes with linear minimum distance

Stopping set distribution of LDPC code ensembles

Similar Documents

Upper Bound on Error Exponent of Regular LDPC Codes Transmitted Over the BEC

An Efficient Algorithm to Find All Small-Size Stopping Sets of Low-Density Parity-Check Matrices

Capacity-achieving ensembles for the binary erasure channel with bounded complexity

Finite-Length Scaling for Iteratively Decoded LDPC Ensembles

Turbo Decoding on the Binary Erasure Channel: Finite-Length Analysis and Turbo Stopping Sets

New Sequences of Capacity Achieving LDPC Code Ensembles Over the Binary Erasure Channel

Bounds on the Number of Iterations for Turbo-Like Ensembles Over the Binary Erasure Channel

Weight Distribution of Low-Density Parity-Check Codes

Performance of low-density parity-check codes with linear minimum distance

Stopping set distribution of LDPC code ensembles