TIT
2002
13 years 10 months ago
2002
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...
ENDM
2002
13 years 10 months ago
2002
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...
CORR
2006
Springer
13 years 11 months ago
2006
Springer
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. ...
GLOBECOM
2009
IEEE
14 years 2 months ago
2009
IEEE
—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...
ICC
2007
IEEE
14 years 5 months ago
2007
IEEE
— 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...