Pseudocodeword weights and stopping sets

Christine Kelley, Deepak Sridhara, Jun Xu, Joachim Rosenthal

Research output: Contribution to journalConference articlepeer-review

17 Scopus citations

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 languageEnglish (US)
Pages (from-to)67
Number of pages1
JournalIEEE International Symposium on Information Theory - Proceedings
StatePublished - 2004
Externally publishedYes
EventProceedings - 2004 IEEE International Symposium on Information Theory - Chicago, IL, United States
Duration: Jun 27 2004Jul 2 2004

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Information Systems
  • Modeling and Simulation
  • Applied Mathematics

Fingerprint Dive into the research topics of 'Pseudocodeword weights and stopping sets'. Together they form a unique fingerprint.

Cite this