Tree-Based Construction of LDPC Codes
信息论
2016-11-17 v1 math.IT
摘要
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.
引用
@article{arxiv.cs/0506042,
title = {Tree-Based Construction of LDPC Codes},
author = {Deepak Sridhara and Christine Kelley and Joachim Rosenthal},
journal= {arXiv preprint arXiv:cs/0506042},
year = {2016}
}
备注
5 pages, 12 figures. To appear in the Proceedings of IEEE International Symposium on Information Theory, Sept. 4-9, 2005, Adelaide, Australia