A Lower Bound for Burst Error Correcting Capability of Low Rate Binary Cyclic Codes

The letter presents a lower bound for burst error correcting capability of a class of binary cyclic codes based on the structure of parity check polynomial and the properties of its circulant matrix. This bound is applied for implementation of an algorithm, which exactly determines codes' error correcting capabilities. The algorithm has less complexity than other ones and is applicable for codes with a large number of parity bits.