The letter presents binary cyclic codes with the maximum burst error correction capability. This is achieved based on the properties of circulant parity check matrix. Results conclude existence of codes with high minimum weight and rate greater than 0.28. It also gives cyclic product codes suitable for multiple burst and random error corrections.
|Number of pages||3|
|Journal||IEEE Communications Letters|
|Publication status||Published - 2012|