Welcome to IEEE Xplore 2.0: Pseudocodeword weights and stopping sets

Cart | Sitemap | Help

Abstract


	BROWSE	SEARCH	IEEE XPLORE GUIDE	SUPPORT

View TOC

Pseudocodeword weights and stopping sets
Kelley, C. Sridhara, D. Jun Xu Rosenthal, J.
Dept. of Math., Notre Dame Univ., IN, USA;

This paper appears in: Information Theory, 2004. ISIT 2004. Proceedings. International Symposium on
Publication Date: 27 June-2 July 2004
On page(s): 67-
ISBN: 0-7803-8280-3
INSPEC Accession Number: 8168214
Digital Object Identifier: 10.1109/ISIT.2004.1365105
Current Version Published: 2005-01-10

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.

Index Terms
Available to subscribers and IEEE members.

References
Available to subscribers and IEEE members.

Citing Documents
Available to subscribers and IEEE members.

You are not logged in.

Guests may access Abstract records free of charge.