On the usage of Projective Geometry based LDPC codes for wireless applications

The projective geometry (PG) based low density parity check (LDPC) codes are gaining popularity due to their ease of encoding and decoding by the simple majority logic technique. These codes have a flurry of other useful properties, making them ideal candidates/codes for error correction for future wireless applications. This paper brings out a detailed study on the performance of PG codes for different decoding algorithms, bearing in mind the implementation issues. The work is extended by providing results for the shortening (rate reduction) and Chase Combining, which aids in bringing out their usefulness for wireless applications.