DocumentCode
2251451
Title
On LDPC codes corresponding to infinite family of graphs A(k, K)
Author
Polak, Monika ; Ustimenko, Vasyl
Author_Institution
Inst. of Math., Maria Curie-Sklodowska Univ., Lublin, Poland
fYear
2012
fDate
9-12 Sept. 2012
Firstpage
567
Lastpage
570
Abstract
In this paper we investigate correcting properties of LDPC error correcting codes obtained from new infinite family of special extremal graphs. We describe how to construct these codes and compare our results with codes obtained by Guinand and Lodge, corresponding to family of graphs D(k, q).
Keywords
error correction codes; graph theory; parity check codes; LDPC codes; error correcting codes; graph infinite family; low density parity check codes; Bit error rate; Decoding; Educational institutions; Error correction codes; Parity check codes; Sparse matrices;
fLanguage
English
Publisher
ieee
Conference_Titel
Computer Science and Information Systems (FedCSIS), 2012 Federated Conference on
Conference_Location
Wroclaw
Print_ISBN
978-1-4673-0708-6
Electronic_ISBN
978-83-60810-51-4
Type
conf
Filename
6354445
Link To Document