A Family of Efficient Burst-Correcting Array Codes

Abstract

A family of binary burst correcting array codes that are defined as follows: Consider an n1 X n2 array with n1 = 4u + v +2 and n2 = 6u +2v +5, u ≥ 1, v ≥ 0, v=1 where each row and column has even parity are presented. The bits are read diagonally starting from the upper-left corner. The columns are viewed cyclically, i.e., the array is a cylinder. If one diagonal has been read out, proceed with the second diagonal preceding it. It is proven that the codes of this type can correct any burst of length up to n1. The burst-correcting efficiency of this family tends to 4/5 as u —> co. As a comparison, the burst-correcting efficiency of other families of array codes tends to 2/3. The same is true for Fire codes. A simple decoding algorithm for the codes is also presented. © 1990 IEEE