Header

UZH-Logo

Maintenance Infos

Pseudocodeword weights and stopping sets


Kelley, C; Sridhara, D; Xu, J; Rosenthal, J (2004). Pseudocodeword weights and stopping sets. In: 2004 IEEE Symposium on Information Theory. Proceedings. Chicago: IEEE, 67.

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.

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.

Statistics

Citations

3 citations in Web of Science®
16 citations in Scopus®
Google Scholar™

Altmetrics

Additional indexing

Other titles:IEEE International Symposium on Information Theory, Chicago, IL, JUN 27-JUL 02, 2004
Item Type:Book Section, refereed, original work
Communities & Collections:07 Faculty of Science > Institute of Mathematics
Dewey Decimal Classification:510 Mathematics
Uncontrolled Keywords:Tanner graph , pseudocodeword weight , stopping set
Language:English
Date:2004
Deposited On:29 Nov 2010 16:26
Last Modified:05 Apr 2016 13:24
Publisher:IEEE
ISBN:0-7803-8280-3
Publisher DOI:https://doi.org/10.1109/ISIT.2004.1365105

Download

Full text not available from this repository.
View at publisher