Mathematics, Department of
Date of this Version
Published in 2009 Information Theory and Applications Workshop (2009)
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.
Copyright 2009 IEEE. Used by permission.