Easily encodable LDPC codes based on polynomial codes

In this paper, two versions of a new class of easily encodable polynomial codes are presented and their performance compared. Both versions are characterized by a sparse parity check matrix that, when specific design criteria are respected, corresponds to a Tanner graph free of short-cycles. These characteristics make such codes LDPC codes and, therefore, decodable through efficient iterative belief propagation algorithms, able to ensure very good error correction performance.