Construction of rate-compatible LDPC codes utilizing information shortening and parity puncturing
EURASIP Journal on Wireless Communications and Networking
Linear-time encodable and decodable error-correcting codes
IEEE Transactions on Information Theory - Part 1
Regular and irregular progressive edge-growth tanner graphs
IEEE Transactions on Information Theory
Hi-index | 0.00 |
Based on the algebraic properties of binary images corresponding to the nonbinary elements, we propose a construction of nonbinary rate-compatible low-density parity-check (RCLDPC) codes at short block length by using bit-wise shortening method. Different from the traditional information-shortening methods, the shortened information bits in the proposed method are carefully chosen according to the degree distributions of their binary images. Simulations show that the performance of proposed method is close to that of uniform bit-wise shortening, and considerable gains can be attained over conventional symbolwise shortening, random bit-wise shortening and their corresponding binary RC-LDPC codes.