In this paper, we address the problem of the optimization of non binary LDPC codes for finite lengths. Using the binary image of the code, we provide a method for both waterfall and error floor improvements based on the algebraic properties of rows, cycles and stopping sets.
展开▼