On the probabilistic computation of the stopping redundancy of LDPC codes

Authors:
Masanori Hirotomo;Yoshiho Konishi;Masakatu Morii
Affiliations:
Graduate School of Engineering, Kobe University, Kobe, Japan;Graduate School of Engineering, Kobe University, Kobe, Japan;Graduate School of Engineering, Kobe University, Kobe, Japan
Venue:
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 1
Year:
2009

Citing 10
Cited 0

A method for finding codewords of small weight

Proceedings of the third international colloquium on Coding theory and applications
On the Stopping Distance and Stopping Redundancy of Finite Geometry LDPC Codes

IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
A new algorithm for finding minimum-weight words in a linear code: application to McEliece's cryptosystem and to narrow-sense BCH codes of length 511

IEEE Transactions on Information Theory
Finite-length analysis of low-density parity-check codes on the binary erasure channel

IEEE Transactions on Information Theory
Stopping set distribution of LDPC code ensembles

IEEE Transactions on Information Theory
On the stopping distance and the stopping redundancy of codes

IEEE Transactions on Information Theory
On the Stopping Redundancy of Reed–Muller Codes

IEEE Transactions on Information Theory
Improved Upper Bounds on Stopping Redundancy

IEEE Transactions on Information Theory
Results on Parity-Check Matrices With Optimal Stopping And/Or Dead-End Set Enumerators

IEEE Transactions on Information Theory
Improved Probabilistic Bounds on Stopping Redundancy

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

On the binary erasure channel (BEC), the performance of low-density parity-check (LDPC) codes decoded by iterative algorithms is estimated by the small stopping sets in the codes. The size of smallest stopping set is called the stopping distance. Since it depends on the structure of parity-check matrix for the code, we can construct the parity-check matrix by adding dependent rows so that the stopping distance is equal to the minimum distance. The stopping redundancy is defined as the smallest number of rows in such a parity-check matrix. In this paper, we propose a probabilistic algorithm for computing the stopping redundancy of LDPC codes. Additionally, we show numerical results of computing the stopping redundancy of (155,64), (504,252) and (1008,504) LDPC codes.