A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2010; you can also visit the original URL.
The file type is application/pdf
.
The Complexity Limits of Graphical Models for Linear Codes
2007
2007 IEEE Information Theory Workshop
Since the discovery of turbo codes in the 1990s, much of the work concerning graphical models for codes has focused on constructing models in order to define a new code. This work focuses on the theoretical foundations of the inverse problem to code construction -extracting a graphical model for a given (fixed) code. Specifically, limits on the space of graphical models for a given code are examined. A number of results concerning these limits (e.g., the cut-set bound, the square-root bound)
doi:10.1109/itw.2007.4313064
fatcat:znh4zgn3r5cx7ez7yvilnvylvm