Codes on graphs: Normal realizations

@article{Forney2001CodesOG,
  title={Codes on graphs: Normal realizations},
  author={G. David Forney},
  journal={IEEE Trans. Information Theory},
  year={2001},
  volume={47},
  pages={520-548}
}
A generalized state realization of the Wiberg type is called normal if symbol variables have degree1 and state variables have degree2. A natural graphical model of such a realization has leaf edges representing symbols, ordinary edges representing states, and vertices representing local constraints. Such a graph can be decoded by any version of the sum-product algorithm. Any state realization of a code can be put into normal form without essential change in the corresponding graph or in its… CONTINUE READING
Highly Influential
This paper has highly influenced 55 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS
Highly Cited
This paper has 645 citations. REVIEW CITATIONS
357 Extracted Citations
44 Extracted References
Similar Papers

Citing Papers

Publications influenced by this paper.
Showing 1-10 of 357 extracted citations

646 Citations

0204060'00'03'07'11'15
Citations per Year
Semantic Scholar estimates that this publication has 646 citations based on the available data.

See our FAQ for additional information.

Referenced Papers

Publications referenced by this paper.
Showing 1-10 of 44 references

A truly behavioral approach to the H control problem

  • H. Trentelman
  • inThe Mathematics of Systems and Control: From…
  • 1999
Highly Influential
5 Excerpts

Group codes and behaviors

  • Dynamical Systems, Control, Coding, Computer…
  • 1999
Highly Influential
5 Excerpts

Similar Papers

Loading similar papers…