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 graph.
| Original language | English (US) |
|---|---|
| Pages (from-to) | 67 |
| Number of pages | 1 |
| Journal | IEEE International Symposium on Information Theory - Proceedings |
| State | Published - 2004 |
| Externally published | Yes |
| Event | Proceedings - 2004 IEEE International Symposium on Information Theory - Chicago, IL, United States Duration: Jun 27 2004 → Jul 2 2004 |
ASJC Scopus subject areas
- Theoretical Computer Science
- Information Systems
- Modeling and Simulation
- Applied Mathematics