On Codes Constructed by Generalized Kronecker Product
Wen-Yao Chen, Chung-Chin Lu · 2007
In this paper, we apply generalized Kronecker product recursively to construct low-density parity-check (LDPC) codes with arbitrarily large girth. The parity check matrices of these codes are block matrices consisting of circulant permutation matrices, thus may benefit from efficient encoding. It turns out that the LU(m, q) codes proposed in the literature is a special case of this construction for prime q. Connectivity of Tanner graphs of these codes are investigated.