A Sufficient Bound for Codes Correcting CT Bursts with Lee weight Constraint
by
Gurdial Arora
Department of Mathematics, Xavier University of Louisiana, New Orleans, LA 70125, USA

The burst error correcting or detecting capabilities of a linear code depends upon the number of parity check symbols. Burst error correcting codes are developed to protect against clusteres errors over a particular length. This type of errors occur in many situations. Most of the studies have been made with a view to burst error correction by considering the position of errors and not the magnitude of errors in a particular position. It is well known that the Lee distance is more suitable for phase modulation as it takes into account the magnitude of the changes.In this paper we will cosider the definition of burst proposed by Chien and Tang (CT). A upper bound on the sufficent condition on the number of parity check digits of a linear code capable of correcting CT bursts of a given length having a Lee weight criteion over them is derived in this paper.

Date received: September 22, 2004