TIT
2002
13 years 4 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...
TCOM
2008
13 years 4 months ago
2008
Importance sampling is used in this paper to address the classical yet important problem of performance estimation of block codes. Simulation distributions that comprise discretean...
ADT
2005
13 years 4 months ago
2005
Coding for channels with synchronization errors is studied. Marker codes, each consisting of a low-density parity-check code with inserted markers, are developed. At low insertion...
CORR
2006
Springer
13 years 4 months ago
2006
Springer
Abstract-- In his thesis, Wiberg showed the existence of thresholds for families of regular low-density parity-check codes under min-sum algorithm decoding. He also derived analyti...
STOC
1998
ACM
13 years 8 months ago
1998
ACM
In [6], Gallager introduces a family of codes based on sparse bipartite graphs, which he calls low-density parity-check codes. He suggests a natural decoding algorithm for these c...
ISCAS
2003
IEEE
13 years 9 months ago
2003
IEEE
A massively scalable architecture for decoding low-density parity-check codes is presented in this paper. This novel architecture uses hardware scaling and memory partitioning to ...