Regular and irregular progressive edge-growth tanner graphs
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 …
establishing edges or connections between symbol and check nodes in an edge-by-edge …
LDPC block and convolutional codes based on circulant matrices
RM Tanner, D Sridhara, A Sridharan… - IEEE Transactions …, 2004 - ieeexplore.ieee.org
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 …
and their convolutional counterparts is presented. The QC codes are described by sparse …
Low-density parity-check codes and their rateless relatives
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 …
family of low-density parity-check LDPC codes and their rateless relatives. In doing so, we …
High-throughput LDPC decoders
MM Mansour, NR Shanbhag - IEEE transactions on very large …, 2003 - ieeexplore.ieee.org
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 …
(LDPC) codes is proposed based on a novel turbo decoding algorithm. The architecture …
Using linear programming to decode binary linear codes
J Feldman, MJ Wainwright… - IEEE Transactions on …, 2005 - ieeexplore.ieee.org
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 …
arbitrary binary linear code based on observations received from any discrete memoryless …
Weaknesses of Margulis and Ramanujan-Margulis low-density parity-check codes
DJC MacKay, MS Postol - Electronic Notes in Theoretical Computer …, 2003 - Elsevier
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 …
based on expander graphs. The Margulis construction gives a code with near-codewords …
Globalizing retail: conceptualizing the distribution-based transnational corporation (TNC)
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 …
urgent theoretical and empirical investigation from economic geographers. Using recent …
LDPC codes: An introduction
A Shokrollahi - Coding, cryptography and combinatorics, 2004 - Springer
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 …
early 1960's, they have experienced an amazing comeback in the last few years. Unlike …
Combinatorial constructions of low-density parity-check codes for iterative decoding
B Vasic, O Milenkovic - IEEE Transactions on information …, 2004 - ieeexplore.ieee.org
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 …
(LDPC) codes, in contrast to the prevalent practice of using long, random-like codes. The …
[HTML][HTML] Cayley graphs as classifiers for data mining: The influence of asymmetries
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 …
convenient tools expressing asymmetries of the graphs. One of the most important classes of …