Title :
Regular LDPC Codes from Strongly Regular (a ,ß )-Geometries
Author :
Li Xiuli ; Shan Zhengduo
Author_Institution :
Sch. of Math, & Phys., Qingdao Univ. of Sci. & Technol., Qingdao, China
Abstract :
By considering a class of combinatorial structures, known as strongly regular (a, beta) -geometries, we define a class of low-density parity-check (LDPC) codes. We derive bounds on minimum distance, rank and girth for the codes from strongly regular (a, beta) -geometries, which have not previously been proposed for use with iterative decoding. In further, we present performance results for the class of codes.
Keywords :
geometry; parity check codes; LDPC codes; combinatorial structures; iterative decoding; low density parity check codes; strongly regular (a, beta)-geometries; Algorithm design and analysis; Block codes; Geometry; Information technology; Iterative decoding; Parity check codes; Sparse matrices; Sum product algorithm; Turbo codes; Gallager codes; beta)$-geometries; iterative decoding; low-density parity-check (LDPC) codes; strongly regular $(alpha;
Conference_Titel :
Information Technology and Applications, 2009. IFITA '09. International Forum on
Conference_Location :
Chengdu
Print_ISBN :
978-0-7695-3600-2
DOI :
10.1109/IFITA.2009.462
