Low-Density Parity-Check Codes Based on Cyclotomic Cosets and their Extension by Latin-Square Matrices

摘要

Recently, some research has been done to generate LDPC codes by using different geometric or algebraic methods and. The main idea in this paper is to design a deterministic LDPC code that demonstrates comparable performance with simpler encoding complexity relative to random LDPC codes. We present a construction of parity-check matrices based on cyclotomic cosets. To have good performance, our goal is to avoid short cycles. Next, by splitting the parity-check matrices of these cyclic codes, we find LDPC codes that have considerably good performance at high SNR's.