Pseudocodeword weights and stopping sets

Christine Kelley, Deepak Sridhara, Jun Xu, Joachim Rosenthal

Research output: Contribution to journalConference article

16 Citations (Scopus)

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)
Number of pages1
JournalIEEE International Symposium on Information Theory - Proceedings
StatePublished - Oct 20 2004
EventProceedings - 2004 IEEE International Symposium on Information Theory - Chicago, IL, United States
Duration: Jun 27 2004Jul 2 2004

Fingerprint

Graph in graph theory
Lower bound

ASJC Scopus subject areas

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

Cite this

Pseudocodeword weights and stopping sets. / Kelley, Christine; Sridhara, Deepak; Xu, Jun; Rosenthal, Joachim.

In: IEEE International Symposium on Information Theory - Proceedings, 20.10.2004.

Research output: Contribution to journalConference article

@article{3ed5c0705e434a3fb02eed79b3fbe7db,
title = "Pseudocodeword weights and stopping sets",
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.",
author = "Christine Kelley and Deepak Sridhara and Jun Xu and Joachim Rosenthal",
year = "2004",
month = "10",
day = "20",
language = "English (US)",
journal = "IEEE International Symposium on Information Theory - Proceedings",
issn = "2157-8097",
publisher = "Institute of Electrical and Electronics Engineers Inc.",

}

TY - JOUR

T1 - Pseudocodeword weights and stopping sets

AU - Kelley, Christine

AU - Sridhara, Deepak

AU - Xu, Jun

AU - Rosenthal, Joachim

PY - 2004/10/20

Y1 - 2004/10/20

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=5044245308&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=5044245308&partnerID=8YFLogxK

M3 - Conference article

AN - SCOPUS:5044245308

JO - IEEE International Symposium on Information Theory - Proceedings

JF - IEEE International Symposium on Information Theory - Proceedings

SN - 2157-8097

ER -