By Topic

LDPC Coding For The Three-Terminal Erasure Relay Channel

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Deepak Sridhara ; Institut für Mathematik, Universität Zürich, CH8057 Zürich, Switzerland. Email: sridhara@math.unizh.ch ; Christine A. Kelley

A three terminal erasure relay channel is considered. It has been shown that appropriately designed maximum distance separable codes achieve the cut-set upper bound on capacity of the three terminal erasure relay channel. This paper presents low-density parity-check (LDPC) coding alternatives for this channel. Design rules for constructing LDPC codes that perform close to the cut-set upper bound on capacity are provided for the general erasure relay channel and also the degraded erasure relay channel, wherein all the information available at the receiver are also available at the relay

Published in:

2006 IEEE International Symposium on Information Theory

Date of Conference:

9-14 July 2006