By Topic

On distributed LDGM and LDPC code design for networked systems

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

3 Author(s)
¿edomir Stefanovi¿ ; Department of Power, Electronics and Communication Engineering, University of Novi Sad, Novi Sad, Serbia ; Dejan Vukobratovi¿ ; Vladimir Stankovi¿

We propose a novel distributed approach for the design of various classes of Low-Density Generator-Matrix (LDGM) and Low-Density Parity-Check (LDPC) codes for applications in networked systems. Distributed LDGM/LDPC codes encode a distributed network message of length k information symbols into a distributed network codeword of length n encoded symbols, with the goal of reliable network message recovery from any subset of (1 + ¿)k encoded symbols retrieved from the network. Different classes of distributed LDGM and LDPC codes are designed and compared in terms of the iterative decoding performance, upon retrieval of a fixed amount of encoded symbols.

Published in:

Information Theory Workshop, 2009. ITW 2009. IEEE

Date of Conference:

11-16 Oct. 2009