CT bursts—from classical to array coding

R.T. Chien and D.T. Tang [On definition of a burst, IBM J. Res. Develop. 9 (1965) 292–293] introduced the concept of Chien and Tang bursts (CT bursts) for classical coding systems where codes are subsets (or subspaces) of the space Fqn, the space of all n  -tuples with entries from a finite field FqFq. In this paper, we extend the notion of CT bursts for array coding systems where array codes are subsets (or subspaces) of the space Matm×s(Fq)Matm×s(Fq), the linear space of all m×sm×s matrices with entries from a finite field FqFq, endowed with a non-Hamming metric [M.Yu. Rosenbloom, M.A. Tsfasman, Codes for m-metric, Problems Inform. Transmission 33 (1997) 45–52]. We also obtain some bounds on the parameters of array codes for the detection and correction of CT burst errors.