A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
LDPC Codes Based on Latin Squares: Cycle Structure, Stopping, and Trapping Set Analysis
2007
IEEE Transactions on Communications
It is well known that certain combinatorial structures in the Tanner graph of a low-density parity-check code exhibit a strong influence on its performance under iterative decoding. These structures include cycles, stopping/trapping sets and parameters such as the diameter of the code. In general, it is very hard to find a complete characterization of such configurations in an arbitrary code, and even harder to understand the intricate relationships that exist between these entities. It is
doi:10.1109/tcomm.2006.887791
fatcat:4c6fxug2fnbtnneq7mlilcmgyu