Regular LDPC Codes from Strongly Regular (a ,ß )-Geometries
Xiuli Li, Zhengduo Shan · 2009
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.