7 search results - page 1 / 2 » A Combinatorial Family of Near Regular LDPC Codes |
73
Voted
CORR
2006
Springer
14 years 9 months ago
2006
Springer
Abstract-- An elementary combinatorial Tanner graph construction for a family of near-regular low density parity check (LDPC) codes achieving high girth is presented. These codes a...
CORR
2006
Springer
14 years 9 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...
101
click to vote
ICC
2011
IEEE
13 years 9 months ago
2011
IEEE
— This paper focuses on controlling absorbing sets for a class of regular LDPC codes, known as separable, circulantbased (SCB) codes. For a specified circulant matrix, SCB codes...
VTC
2008
IEEE
15 years 3 months ago
2008
IEEE
Abstract— In this contribution, we investigate the attainable performance of quasi-cyclic (QC) protograph Low-Density Parity-Check (LDPC) codes for transmission over both Additiv...
ICC
2007
IEEE
15 years 3 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...