We propose a general method for constructing Tanner graphs having a large girth by
establishing edges or connections between symbol and check nodes in an edge-by-edge …

A class of algebraically structured quasi-cyclic (QC) low-density parity-check (LDPC) codes
and their convolutional counterparts is presented. The QC codes are described by sparse …

This survey guides the reader through the extensive open literature that is covering the
family of low-density parity-check LDPC codes and their rateless relatives. In doing so, we …

A high-throughput memory-efficient decoder architecture for low-density parity-check
(LDPC) codes is proposed based on a novel turbo decoding algorithm. The architecture …

A new method is given for performing approximate maximum-likelihood (ML) decoding of an
arbitrary binary linear code based on observations received from any discrete memoryless …

We report weaknesses in two algebraic constructions of low-density parity-check codes
based on expander graphs. The Margulis construction gives a code with near-codewords …

LDPC codes are one of the hottest topics in coding theory today. Originally invented in the
early 1960's, they have experienced an amazing comeback in the last few years. Unlike …

In this article we argue that the retail transnational corporation (TNC) is an entity that merits
urgent theoretical and empirical investigation from economic geographers. Using recent …

The endomorphism monoids of graphs have been actively investigated. They are
convenient tools expressing asymmetries of the graphs. One of the most important classes of …

This paper introduces several new combinatorial constructions of low-density parity-check
(LDPC) codes, in contrast to the prevalent practice of using long, random-like codes. The …