Campopiano-type bounds in non-Hamming array coding

Abstract: Campopiano [C.N. Campopiano, Bounds on burst error correcting codes, IRE Trans. IT-8 (1962) 257–259] obtained an upper bound for burst error correction in classical coding systems where codes are subsets/subspaces of the space , the space of all n-tuples with entries from a finite field F q equipped with the Hamming metric. In [S. Jain, Bursts in m-metric array codes, Linear Algebra Appl., in press], the author introduced the notion of burst errors for m-metric array coding systems where m-metric array codes are subsets/subspaces of the space Mat m×s (F q ), the linear space of all m × s matrices with entries from a finite field F q , endowed with a non-Hamming metric and obtained some lower bounds for burst error correction. In this paper, we obtain various construction upper bounds on the parameters of m-metric array codes for the detection and correction of burst errors. [Copyright &y& Elsevier]