Stopping Set Distributions of Some Linear Codes
- 1 October 2006
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 47-51
Abstract
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 determined with explicit formula. With parity-check matrix formed by all the nonzero codewords of the simplex code, the SSD of the Hamming code is completely determined with two recursive equations. Then, the first order Reed-Muller codes and the extended Hamming codes are discussed. With parity-check matrix formed by all the weight 4 codewords of the extended Hamming code, the SSD of the first order Reed-Muller code is completely determined with explicit formula. With parity-check matrix formed by all the minimum codewords of the first order Reed-Muller code, the SSD of the extended Hamming code is completely determined with two recursive equationsKeywords
This publication has 6 references indexed in Scilit:
- Complete Enumeration of Stopping Sets of Full-Rank Parity-Check Matrices of Hamming CodesIEEE Transactions on Information Theory, 2007
- On the stopping distance of finite geometry ldpc codesIEEE Communications Letters, 2006
- Codes on finite geometriesIEEE Transactions on Information Theory, 2005
- Stopping set analysis for Hamming codes2005
- On the stopping distance and the stopping redundancy of codes2005
- Finite-length analysis of low-density parity-check codes on the binary erasure channelIEEE Transactions on Information Theory, 2002