DocumentCode
2025446
Title
On Codes Constructed by Generalized Kronecker Product
Author
Wen-Yao Chen ; Chung-Chin Lu
Author_Institution
Nat. Tsing Hua Univ., Hsinchu
fYear
2007
fDate
24-29 June 2007
Firstpage
1236
Lastpage
1240
Abstract
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.
Keywords
block codes; encoding; graphs; matrix algebra; parity check codes; Tanner graph connectivity; block matrices; circulant permutation matrices; encoding; generalized Kronecker product; low density parity check codes; parity check matrices; Belief propagation; Bipartite graph; Decoding; Encoding; Graph theory; Parity check codes;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Theory, 2007. ISIT 2007. IEEE International Symposium on
Conference_Location
Nice
Print_ISBN
978-1-4244-1397-3
Type
conf
DOI
10.1109/ISIT.2007.4557392
Filename
4557392
Link To Document