Cyclic low density parity check codes with the optimum burst error correcting capability

The paper presents a new scheme of cyclic codes suitable for the correction of burst errors. This is accomplished by the proper definition of their parity check polynomials in which the difference between orders of every two consecutive elements of the utilized polynomial is unique and in order of power of 2. In the proposed polynomials, the number of applied elements is much lower than their orders (or codes' lengths). This leads to represent codes as a class of low-density parity check (LDPC) codes, while they do not have any 4 cycle in their Tanner graphs. Considering the properties of the circulant matrix and structure of the defined polynomials, it is proven that codes have the optimum burst error-correcting capability. This is evident for short and long length codes. Moreover, it is shown that constructed codes can be combined with Fire codes and demonstrate cyclic codes that are applicable for the simultaneous correction of random and burst errors.