DocumentCode
1935679
Title
Low-density parity-check codes based on the independent subgroups
Author
Ivanov, Fedor ; Zyablov, Victor ; Potapov, Vladimir
Author_Institution
Inst. for Inf. & Transm. Problems, Moscow, Russia
fYear
2012
fDate
5-10 Sept. 2012
Firstpage
31
Lastpage
34
Abstract
Two criteria of cyclic subgroups independence are proved. The ensemble of regular binary LDPC codes which are based on independent subgroups, is built. The condition of absence of the cycles of the length 4 is proved for the resulting code construction. The results of the received code constructions are presented for the iterative algorithm Sum-Product when the codeword is transmitted over channel with additive Gaussian white noise (AGWN).
Keywords
AWGN; binary codes; iterative methods; parity check codes; AGWN; additive Gaussian white noise; code construction; cyclic subgroup independence; independent subgroups; iterative algorithm; low-density parity-check codes; received code constructions; regular binary LDPC codes; sum-product; Additives; Control systems; Electronic mail; Equations; Iterative methods; Parity check codes; Redundancy;
fLanguage
English
Publisher
ieee
Conference_Titel
Problems of Redundancy in Information and Control Systems (RED), 2012 XIII International Symposium on
Conference_Location
St. Petersburg
Print_ISBN
978-1-4673-0168-8
Type
conf
DOI
10.1109/RED.2012.6338401
Filename
6338401
Link To Document