NDLI: The Trapping Redundancy of Linear Block Codes

Content Provider	IEEE Xplore Digital Library
Author	Laendner, S. Hehn, T. Milenkovic, O. Huber, J.B.
Copyright Year	1963
Abstract	We generalize the notion of the stopping redundancy in order to study the smallest size of a trapping set in Tanner graphs of linear block codes. In this context, we introduce the notion of the trapping redundancy of a code, which quantifies the relationship between the number of redundant rows in any parity-check matrix of a given code and the size of its smallest trapping set. Trapping sets with certain parameter sizes are known to cause error-floors in the performance curves of iterative belief propagation (BP) decoders, and it is therefore important to identify decoding matrices that avoid such sets. Bounds on the trapping redundancy are obtained using probabilistic and constructive methods, and the analysis covers both general and elementary trapping sets. Numerical values for these bounds are computed for the [2640, 1320] Margulis code and the class of projective geometry codes, and compared with some new code-specific trapping set size estimates.
Sponsorship	IEEE Information Theory Society
Starting Page	53
Ending Page	63
Page Count	11
File Size	292878
File Format	PDF
ISSN	00189448
Volume Number	55
Issue Number	1
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2009-01-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	Block codes Parity check codes Redundancy Iterative decoding Upper bound Belief propagation Computational geometry Error correction codes Error analysis trapping sets Belief propagation (BP) low-density parity-check (LDPC) codes Margulis codes projective geometry (PG) codes trapping redundancy
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

On Trapping Sets and Guaranteed Error Correction Capability of LDPC Codes and GLDPC Codes

Mean field and mixed mean field iterative decoding of low-density parity-check codes

Using input/output queues to increase LDPC decoder performance

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

Sinkhorn Solves Sudoku

Upper bound on the error exponent of regular LDPC codes transmitted over the BEC

Augmented Belief Propagation Decoding of Low-Density Parity Check Codes

Decoding architectures for Projective Geometry based LDPC codes

Improvement of Shuffled Iterative Decoding

The Trapping Redundancy of Linear Block Codes

Similar Documents

On Trapping Sets and Guaranteed Error Correction Capability of LDPC Codes and GLDPC Codes

Mean field and mixed mean field iterative decoding of low-density parity-check codes

Using input/output queues to increase LDPC decoder performance

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

Sinkhorn Solves Sudoku

Upper bound on the error exponent of regular LDPC codes transmitted over the BEC

Augmented Belief Propagation Decoding of Low-Density Parity Check Codes

Decoding architectures for Projective Geometry based LDPC codes

Improvement of Shuffled Iterative Decoding

The Trapping Redundancy of Linear Block Codes