Sciweavers

13 search results - page 1 / 3
» Capacity-achieving sequences for the erasure channel
Sort
View
JSAC
2008
78views more  JSAC 2008»
13 years 10 months ago
Joint iterative decoding of LDPC codes for channels with memory and erasure noise
This paper investigates the joint iterative decoding of low-density parity-check (LDPC) codes and channels with memory. Sequences of irregular LDPC codes are presented that achieve...
Henry D. Pfister, Paul H. Siegel
TIT
2002
77views more  TIT 2002»
13 years 10 months ago
Capacity-achieving sequences for the erasure channel
Abstract-- This paper starts a systematic study of capacityachieving sequences of low-density parity-check codes for the erasure channel. We introduce a class Aof analytic function...
P. Oswald, A. Shokrollahi
CORR
2004
Springer
144views Education» more  CORR 2004»
13 years 10 months ago
Iterative Quantization Using Codes On Graphs
We study codes on graphs combined with an iterative message passing algorithm for quantization. Specifically, we consider the binary erasure quantization (BEQ) problem which is th...
Emin Martinian, Jonathan S. Yedidia
ICIP
2004
IEEE
15 years 13 days ago
Rate-constrained adaptive fec for video over erasure channels with memory
Current adaptive FEC schemes used for video streaming applications alter the redundancy in a block of message packets to adapt to varying channel conditions. However, for many pop...
Shirish S. Karande, Hayder Radha
ICMCS
2005
IEEE
82views Multimedia» more  ICMCS 2005»
14 years 4 months ago
Globally Optimal Uneven Erasure-Protected Multi-Group Packetization of Scalable Codes
We study the problem of rate-distortion optimal packetization with uneven erasure protection (UEP) of scalable source sequence, into multiple groups of packets. The grouping of pa...
Sorina Dumitrescu, Xiaolin Wu