Graph theoretic construction of generalized product codes

In this note we describe a construction, based on bipartite graphs of high girth, of codes which lend themselves to an iterative MAP decoding strategy.

Saved in:
Bibliographic Details
Main Authors: Guinand, P.S., Lodge, J.H.
Format: Conference Proceeding
Language:English
Subjects:
Bipartite graph
Error correction codes
Iterative decoding
Parity check codes
Product codes
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:In this note we describe a construction, based on bipartite graphs of high girth, of codes which lend themselves to an iterative MAP decoding strategy.
DOI:10.1109/ISIT.1997.613026