Stopping Set Distributions of Some Linear Codes

  title={Stopping Set Distributions of Some Linear Codes},
  author={Yong Jiang and Shutao Xia and Fangwei Fu},
  journal={2006 IEEE Information Theory Workshop - ITW '06 Chengdu},
In this paper, the stopping set distributions (SSD) of some well-known binary linear codes are determined by using finite geometry theory. Similar to the weight distribution of a binary linear code, the SSD {Ti(H)}n i=0 enumerates the number of stopping sets with size i of a linear code with parity-check matrix H. First, we deal with the simplex codes and Hamming codes. With parity-check matrix formed by all the weight 3 codewords of the Hamming code, the SSD of the simplex code is completely… 
Stopping Sets of Algebraic Geometry Codes
The stopping sets, the stopping set distribution, and the stopping distance of the AG code from an elliptic Curve are reduced to the search, counting, and decision versions of the subset sum problem in the group of rational points of the elliptic curve, respectively.
Stopping Set Distributions of Algebraic Geometry Codes from Elliptic Curves
The stopping sets and stopping set distribution of a binary linear code play an important role in the iterative decoding of the linear code over a binary erasure channel and the group structure of rational points of elliptic curves is used to present a complete characterization of stopping sets.
Stopping Set Distributions of Some Reed–Muller Codes
Finite geometry in combinatorics is used to obtain BEC-optimal parity-check matrices and then determine the stopping set distributions for the Simplex codes, the Hamming code, the first order Reed-Muller codes, and the extended Hamming codes, which are some Reed-muller Codes or their shortening or puncturing versions.
Generalized Stopping Sets and Stopping Redundancy
A general iterative decoding technique that gives a more refined trade-off between complexity and performance, and basic properties and examples of both generalized stopping sets and generalized stopping redundancy are presented.
Generalized Iterative Decoding for Linear Block Codes on the Binary Erasure Channel
This paper considers aspects regarding the implementation of generalized iterative decoding and determines the minimum order (as a function of the girth) that can potentially lead to improvement over traditional iterative decode.
On the minimum stopping sets of product codes
It is shown that the certain combinatorial structures called stopping sets have the important role in analysis of iterative decoding and the number of minimum stopping sets of the corresponding component codes is determined.


On the Stopping Redundancy of Reed-Muller Codes
  • T. Etzion
  • Computer Science
    IEEE Trans. Inf. Theory
  • 2006
It is proved that the stopping redundancy of R(m-2,m), which is also the extended Hamming code of length 2m, is 2m-1 and thus it is shown that the recursive bound is tight in this case.
On the stopping distance and the stopping redundancy of codes
It is proved that the family of binary Reed-Muller codes (of all orders) is at most a constant times their conventional redundancy, and general bounds on the stopping redundancy of linear codes are derived.
Minimum Pseudo-Codewords of LDPC Codes
LP decoding for low-density parity-check codes is asymptotically optimal in the sense that the ratio of the probabilities of decoding errors of LP decoding and maximum-likelihood (ML) decoding approaches to 1 as the signal-to-noise ratio leads to infinity.
Stopping set distribution of LDPC code ensembles
Several results on the asymptotic behavior of stopping sets in Tanner-graph ensembles are derived, including an expression for the normalized average stopping set distribution, yielding a critical fraction of the block length above which codes have exponentially many stopping sets of that size.
Permutation Decoding and the Stopping Redundancy Hierarchy of Cyclic and Extended Cyclic Codes
A novel decoding technique is developed, termed automorphism group decoding, that combines iterative message passing and permutation decoding and demonstrates that for a large number of algebraic codes, the performance of the new decoding method is close to that of maximum-likelihood (ML) decoding.
The Theory of Error-Correcting Codes
Improved Upper Bounds on Stopping Redundancy
New upper bounds on stopping redundancy for all linear codes in general and for maximum distance separable (MDS) codes specifically are derived by upper-bounding the stopping redundancy by a combinatorial quantity closely related to Turan numbers.
Complete Enumeration of Stopping Sets of Full-Rank Parity-Check Matrices of Hamming Codes
This correspondence derives an expression for the number of stopping sets of any given size for the same parity-check matrix of the Hamming code.
LDPC Codes Based on Latin Squares: Cycle Structure, Stopping Set, and Trapping Set Analysis
This study can be extended in several different directions, one of which is concerned with modifying the code design process in order to eliminate or reduce the number of configurations bearing a negative influence on the performance of the code.
Stopping set analysis for Hamming codes
This paper investigates how the number of stopping sets of size three in a Hamming code depends on the parity-check matrix used in the decoding process, and presents basic results on stopping set enumerators for block codes in general and on Hamming codes.