Abstract
For a given block length and given degree sequences of the underlying Tanner graph (TG), the ensemble of short low-density parity-check (LDPC) codes can have considerable variation in performance. We present an efficient heuristic method to find good LDPC codes based on what we define as the girth distribution of the TG. This method can be used effectively to design short codes for applications where delay and complexity are of major concern

This publication has 3 references indexed in Scilit: