Quasi cyclic LDPC codes based on finite set systems

A finite set system (FSS) is a pair(V,B) whereVis a finite set whose members are called points, equipped with a finite collection of its subsetsBwhose members are called blocks. In this paper, FSSs are used to define a class of quasi-cyclic low-density parity-check (LDPC) codes, called FSS codes, such that the constructed codes possess large girth and arbitrary column-weight distributions. Especially, the constructed column weight-2 FSS codes have higher rates than the column weight-2 geometric and cylinder-type codes with the same girths. To find the maximum girth of FSS codes based on (V,B), inevitable walks are defined inBsuch that the maximum girth is determined by the smallest length of the inevitable walks inB. Simulation results show that the constructed FSS codes have very good performance over the additive white Gaussian noise channel with iterative decoding and achieve significantly large coding gains compared with the random-like LDPC codes of the same lengths and rates.

LDPC Code, Tanner Graph, Girth