CaltechAUTHORS
Published 1997 | Version public
Book Section - Chapter Open

A general algorithm for distributing information in a graph

Creators

  • 1. ROR icon California Institute of Technology

Abstract

We present a general "message-passing" algorithm for distributing information in a graph. This algorithm may help us to understand the approximate correctness of both the Gallager-Tanner-Wiberg algorithm, and the turbo-decoding algorithm.

Additional Information

© Copyright 1997 IEEE. Reprinted with permission. This work was supported by NSF grant no. NCR-9505975 and a grant from Pacific Bell.

Files

AJIisit97.pdf

Files (128.1 kB)

Name Size
md5:7a3f40c4dd7fc6b938a5b33a02ead8eb
128.1 kB Preview Download

Additional details

Identifiers

Eprint ID
3223
Resolver ID
CaltechAUTHORS:AJIisit97

Dates

Created
2006-05-23
Created from EPrint's datestamp field
Updated
2021-11-08
Created from EPrint's last_modified field