Pseudocodeword weights and stopping sets
Authors:
- C. KelleyCKC. Kelley
- D. SridharaDSD. Sridhara
- Jun XuJXJun Xu
- J. RosenthalJRJ. Rosenthal
- 1 January 2004
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
We examine the structure of pseudocodewords in Tanner graphs and derive lower bounds of pseudocodeword weights. The weight of a pseudocodeword is related to the size of its support set, which forms a stopping set in the Tanner graphKeywords
This publication has 1 reference indexed in Scilit: