Mathematics, Department of
Department of Mathematics: Faculty Publications
Accessibility Remediation
If you are unable to use this item in its current form due to accessibility barriers, you may request remediation through our remediation request form.
Document Type
Article
Date of this Version
2009
Citation
Published in 2009 Information Theory and Applications Workshop (2009)
DOI: 10.1109/ITA.2009.5044971
Abstract
Connections between graph cover pseudocodewords and computation tree pseudocodewords are investigated with the aim of bridging the gap between the theoretically attractive analysis of graph covers and the more intractable analysis of iterative message-passing algorithms that are intuitively linked to graph covers. Both theoretical results and numerous examples are presented.
Comments
Copyright 2009 IEEE. Used by permission.