CaltechAUTHORS
  A Caltech Library Service

A general algorithm for distributing information in a graph

Aji, Srinivas M. and McEliece, Robert J. (1997) A general algorithm for distributing information in a graph. In: Proceedings, 1997 IEEE International Symposium on Information Theory (ISIT '97), Ulm, Germany, June 29-July 4, 1997. IEEE , Piscataway, NJ, p. 6. ISBN 0-7803-3956-8 http://resolver.caltech.edu/CaltechAUTHORS:AJIisit97

[img]
Preview
PDF
See Usage Policy.

125Kb

Use this Persistent URL to link to this item: http://resolver.caltech.edu/CaltechAUTHORS:AJIisit97

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.


Item Type:Book Section
Additional Information:© Copyright 1997 IEEE. Reprinted with permission. This work was supported by NSF grant no. NCR-9505975 and a grant from Pacific Bell.
Subject Keywords:Gallager-Tanner-Wiberg algorithm, approximate correctness, graph, information distribution, message-passing algorithm, turbo-decoding algorithm
Record Number:CaltechAUTHORS:AJIisit97
Persistent URL:http://resolver.caltech.edu/CaltechAUTHORS:AJIisit97
Alternative URL:http://dx.doi.org/10.1109/ISIT.1997.612921
Usage Policy:No commercial reproduction, distribution, display or performance rights in this work are provided.
ID Code:3223
Collection:CaltechAUTHORS
Deposited By: Archive Administrator
Deposited On:23 May 2006
Last Modified:26 Dec 2012 08:53

Repository Staff Only: item control page