(n1b1, n2b2, n3b3) - OPTIMAL BURST ERROR CORRECTING CODES OVER GF (2)

Abstract

This paper explores the possibilities of the existence of block-wise burst error correcting (BBEC) optimal codes where the burst is considered in the sense of Chein and Tang and the code length n is partitioned into sub-blocks. An (n1b1, n2b2, n3b3) optimal code is defined as a block-wise burst error correcting linear code that can correct all bursts of length b1 (fixed), in the first n1 components, all burst of length b2 (fixed) in the next n2 components and all burst of length b3 (fixed) in the last n3 components (n = n1 + n2 + n3) and no other error pattern. When burst length is same i.e. b1 = b2= b3 , the codes are treated as byte correcting codes.