On the Minimum/Stopping Distance of Array Low-Density Parity-Check Codes
From MaRDI portal
Publication:2986138
DOI10.1109/TIT.2014.2333519zbMATH Open1360.94382arXiv1205.2590OpenAlexW3105533917MaRDI QIDQ2986138FDOQ2986138
Authors: Eirik Rosnes, M. Ambroze, M. Tomlinson 
Publication date: 16 May 2017
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Abstract: In this work, we study the minimum/stopping distance of array low-density parity-check (LDPC) codes. An array LDPC code is a quasi-cyclic LDPC code specified by two integers q and m, where q is an odd prime and m <= q. In the literature, the minimum/stopping distance of these codes (denoted by d(q,m) and h(q,m), respectively) has been thoroughly studied for m <= 5. Both exact results, for small values of q and m, and general (i.e., independent of q) bounds have been established. For m=6, the best known minimum distance upper bound, derived by Mittelholzer (IEEE Int. Symp. Inf. Theory, Jun./Jul. 2002), is d(q,6) <= 32. In this work, we derive an improved upper bound of d(q,6) <= 20 and a new upper bound d(q,7) <= 24 by using the concept of a template support matrix of a codeword/stopping set. The bounds are tight with high probability in the sense that we have not been able to find codewords of strictly lower weight for several values of q using a minimum distance probabilistic algorithm. Finally, we provide new specific minimum/stopping distance results for m <= 7 and low-to-moderate values of q <= 79.
Full work available at URL: https://arxiv.org/abs/1205.2590
Cited In (4)
- High stopping-distance LDPC product codes based on Hamming and finite geometry codes.
- An effective algorithm for the spark of sparse binary measurement matrices
- Effect of one redundant parity-check equation on the stopping distance
- Addendum to “An Efficient Algorithm to Find All Small-Size Stopping Sets of Low-Density Parity-Check Matrices”
This page was built for publication: On the Minimum/Stopping Distance of Array Low-Density Parity-Check Codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2986138)
