Tree-Based Construction of LDPC Codes
<|reference_start|>Tree-Based Construction of LDPC Codes: We present a construction of LDPC codes that have minimum pseudocodeword weight equal to the minimum distance, and perform well with iterative decoding. The construction involves enumerating a d-regular tree for a fixed number of layers and employing a connection algorithm based on mutually orthogonal Latin squares to close the tree. Methods are presented for degrees d=p^s and d = p^s+1, for p a prime, -- one of which includes the well-known finite-geometry-based LDPC codes.<|reference_end|>
@article{sridhara2005tree-based,
    title={Tree-Based Construction of LDPC Codes},
    author={Deepak Sridhara, Christine Kelley, and Joachim Rosenthal},
    journal={arXiv preprint arXiv:cs/0506042},
    year={2005},
    doi={10.1109/ISIT.2005.1523456},
    archivePrefix={arXiv},
    eprint={cs/0506042},
    primaryClass={cs.IT math.IT}
}