Sciweavers

TIT
2002
77views more  TIT 2002»
13 years 11 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
ENDM
2002
109views more  ENDM 2002»
13 years 11 months ago
Graph Operations and Zipfian Degree Distributions
The probability distribution on a set S = { 1, 2, . . . , n } defined by Pr(k) = 1/(Hnk), where Hn in the nth harmonic number, is commonly called a Zipfian distribution. In this no...
Walter W. Kirchherr
CORR
2006
Springer
99views Education» more  CORR 2006»
13 years 11 months ago
Intermediate Performance of Rateless Codes
Abstract-- Fountain codes are designed so that all input symbols can be recovered from a slightly larger number of coded symbols, with high probability using an iterative decoder. ...
Sujay Sanghavi
GLOBECOM
2009
IEEE
14 years 2 months ago
Rateless Codes with Optimum Intermediate Performance
—In this paper, we design several degree distributions for rateless codes with optimum intermediate packet recovery rates. In rateless coding, the employed degree distribution si...
Ali Talari, Nazanin Rahnavard
ICC
2007
IEEE
118views Communications» more  ICC 2007»
14 years 5 months ago
A Class of LDPC Erasure Distributions with Closed-Form Threshold Expression
— In this paper, a family of low-density parity-check (LDPC) degree distributions, whose decoding threshold on the binary erasure channel (BEC) admits a simple closed form, is pr...
Enrico Paolini, Marco Chiani