The construction of good, finite-length, LDPC codes is currently an attractive research area. Reducing attention to the Binary Erasure Channel (BEC), this problem translates into t...
Dejan Vukobratovic, Aleksandar Djurendic, Vojin Se...
In this paper, an expression for the asymptotic growth rate of the number of small linear-weight codewords of irregular doubly-generalized LDPC (D-GLDPC) codes is derived. The expr...
Mark F. Flanagan, Enrico Paolini, Marco Chiani, Ma...
Abstract— In this paper, we investigate the application of nonbinary low density parity check (LDPC) codes over Galois field GF(q) for both single-input single-output (SISO) and...
Locally testable codes, i.e., codes where membership in the code is testable with a constant number of queries, have played a central role in complexity theory. It is well known t...
Eli Ben-Sasson, Ghid Maatouk, Amir Shpilka, Madhu ...
Abstract— In recent years performance prediction for communication systems utilizing iteratively decodable codes has been of considerable interest. There have been significant b...