Irreducible polynomials play an important role in design of Forward Error Correction (FEC) codes for data transmission with integrity and automatic correction of data, as for example, Low-Density Parity Check codes. The usage of irreducible polynomials enables construction of non-prime-order finite fields. Most of the irreducible polynomials belong to binary Galois field. The important analytical concept is optimisation of irreducible polynomials for use in FECs in nonbinary Galois (NBG) field, leading to the development of an algorithm for LDPC that can work with nonbinary Galois fields. According to studies, the Tanner graph for ‘nonbinary Low Density Parity Check’ codes might get sparser as the field’s dimensions rise, ensuring that they do much better than their binary counterparts. A detailed discussion of representation of nonbinary irreducible polynomial and the computations involved have been illustrated. The concept has been tried for NB-LDPC codes. To prove the notion, computational complexity is found from different parameters such as performance of error correction capability, complexity cost and simulation time taken. Such detail study makes the NBG fields-based FEC very suitable for high-speed data transmission with self-error correction.
Part of the book: Recent Advances in Polynomials