Connections between computation trees and graph covers
Dreher, D.
Walker, J.L.
Dept. of Math., Univ. of Nebraska-Lincoln, Lincoln, NE;
This paper appears in: Information Theory and Applications Workshop, 2009
Publication Date: 8-13 Feb. 2009
On page(s): 360-364
Location: San Diego, CA,
ISBN: 978-1-4244-3990-4
INSPEC Accession Number: 10702580
Digital Object Identifier: 10.1109/ITA.2009.5044971
Current Version Published: 2009-05-29
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.
Index
Terms
Available to subscribers and IEEE members.
References
Available to subscribers and IEEE members.
Citing Documents
Available to subscribers and IEEE members.
Cart
