On the stopping distance and the stopping redundancy of codes

DOI10.1109/TIT.2005.864441zbMATH Open1317.94153DBLPjournals/tit/SchwartzV06arXivcs/0503058OpenAlexW2140227657WikidataQ59903138 ScholiaQ59903138MaRDI QIDQ3547600FDOQ3547600

Authors: Moshe Schwartz, Alexander Vardy 

Publication date: 21 December 2008

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Abstract: It is now well known that the performance of a linear code $C$ under iterative decoding on a binary erasure channel (and other channels) is determined by the size of the smallest stopping set in the Tanner graph for $C$. Several recent papers refer to this parameter as the emph{stopping distance} $s$ of $C$. This is somewhat of a misnomer since the size of the smallest stopping set in the Tanner graph for $C$ depends on the corresponding choice of a parity-check matrix. It is easy to see that $sled$, where $d$ is the minimum Hamming distance of $C$, and we show that it is always possible to choose a parity-check matrix for $C$ (with sufficiently many dependent rows) such that $s=d$. We thus introduce a new parameter, termed the emph{stopping redundancy} of $C$, defined as the minimum number of rows in a parity-check matrix $H$ for $C$ such that the corresponding stopping distance $s(H)$ attains its largest possible value, namely $s(H)=d$. We then derive general bounds on the stopping redundancy of linear codes. We also examine several simple ways of constructing codes from other codes, and study the effect of these constructions on the stopping redundancy. Specifically, for the family of binary Reed-Muller codes (of all orders), we prove that their stopping redundancy is at most a constant times their conventional redundancy. We show that the stopping redundancies of the binary and ternary extended Golay codes are at most 35 and 22, respectively. Finally, we provide upper and lower bounds on the stopping redundancy of MDS codes.

Full work available at URL: https://arxiv.org/abs/cs/0503058

Recommendations

• On the Stopping Redundancy of Reed–Muller Codes
• Improved Probabilistic Bounds on Stopping Redundancy
• Improved Upper Bounds on Stopping Redundancy
• Two classes of optimal stopping redundancy codes.
• Stopping sets of binary parity-check matrices with constant weight columns and stopping redundancy of the associated codes

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Combinatorial codes (94B25)

Cited In (21)

• An iterative algorithm and low complexity hardware architecture for fast acquisition of long PN codes in UWB systems
• Absorbing sets of codes from finite geometries
• Stopping sets of binary parity-check matrices with constant weight columns and stopping redundancy of the associated codes
• High stopping-distance LDPC product codes based on Hamming and finite geometry codes.
• The stopping distance of binary BCH-code parity-check matrices
• On the minimum stopping sets of product codes
• Generic erasure correcting sets: bounds and constructions
• Two classes of optimal stopping redundancy codes.
• Stopping Set Distributions of Some Reed–Muller Codes
• On the stopping distance of LDPC codes based on symplectic space over finite fields
• Stopping Sets of Hermitian Codes
• New results on the pseudoredundancy
• On the Stopping Redundancy of Reed–Muller Codes
• Improved Upper Bounds on Stopping Redundancy
• Complete Enumeration of Stopping Sets of Full-Rank Parity-Check Matrices of Hamming Codes
• Extremal absorbing sets in low-density parity-check codes
• Analysis of Termatiko sets in measurement matrices
• Improved Probabilistic Bounds on Stopping Redundancy
• Results on Parity-Check Matrices With Optimal Stopping And/Or Dead-End Set Enumerators
• Permutation Decoding and the Stopping Redundancy Hierarchy of Cyclic and Extended Cyclic Codes
• Average Stopping Set Weight Distributions of Redundant Random Ensembles

This page was built for publication: On the stopping distance and the stopping redundancy of codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3547600)