DocumentCode :
1760810
Title :
More on the Minimum Distance of Array LDPC Codes
Author :
Haiyang Liu ; Shipei Yang ; Gang Deng ; Jie Chen
Author_Institution :
Inst. of Microelectron., Beijing, China
Volume :
18
Issue :
9
fYear :
2014
fDate :
Sept. 2014
Firstpage :
1479
Lastpage :
1482
Abstract :
Array low-density parity-check (LDPC) codes are a special class of quasi-cyclic LDPC codes constructed from a pair of integers (m, q), where q is an odd prime, and m ≤ q. In this paper, an improved upper bound on the minimum distance of this class of codes is given.
Keywords :
cyclic codes; parity check codes; array LDPC codes; codes minimum distance; low-density parity-check codes; odd prime; quasicyclic LDPC codes; Arrays; Charge carrier processes; Computers; Generators; Linear codes; Parity check codes; Upper bound; Array codes; low-density parity-check (LDPC) codes; minimum distance;
fLanguage :
English
Journal_Title :
Communications Letters, IEEE
Publisher :
ieee
ISSN :
1089-7798
Type :
jour
DOI :
10.1109/LCOMM.2014.2320929
Filename :
6807669
Link To Document :
بازگشت