Low-Rate Non-binary Hybrid LDPC Codes

In this paper, ere use the class of non-binary hybrid LDPC codes to design very efficient low rate codes. To this end, we consider both asymptotic and finite length designs. First, we present an asymptotic analysis to design hybrid LDPC codes distributions and we explicit the cases when it is usefull to use it. Then, by optimizing the algebraic properties of some topologies related to the Tanner graph, we design finite length codes. These codes show significant performance improvements both in the waterfall and in the error floor regions, in comparison with existing state-of-the-art low rate coding schemes, like Turbo Hadamard or parallel concatenated Zigzag Hadamard codes, and with no increase of complexity. In particular, the minimum distance of low rate. hybrid LDPC codes is by far greater than the ones of previously mentionned codes.