Limiting efficiencies of burst-correcting array codes

The author evaluates the limiting efficiencies e(-S) of burst-correcting array codes A(n/sub 1/,n/sub 2/, -s) for all negative readouts -s as n/sub 2/ tends to infinity and n/sub 1/ is properly chosen to maximize the efficiency. Specializing the result to the products of the first i primes donated by s/sub i/ (1 or=4/5 and e(-1)>or=2/3. This result reveals the existence of burst-correcting array codes with efficiencies arbitrarily close to 1 and with rates also arbitrarily close to 1. >

[1]  WENLONG ZHANG,et al.  A class of binary burst error-correcting quasi-cyclic codes , 1988, IEEE Trans. Inf. Theory.

[2]  W. M. C. J. van Overveld.  Multiple-burst error-correcting cyclic product codes , 1987, IEEE Trans. Inf. Theory.

[3]  S. H. Reiger,et al.  Codes for the correction of 'clustered' errors , 1960, IRE Trans. Inf. Theory.

[4]  Mario Blaum,et al.  A family of efficient burst-correcting array codes , 1990, IEEE Trans. Inf. Theory.

[5]  Mario Blaum,et al.  A class of burst error-correcting array codes , 1986, IEEE Trans. Inf. Theory.

[6]  M. Blaum,et al.  Multiple burst-correcting array codes , 1988, IEEE Trans. Inf. Theory.

[7]  P. G. Farrell,et al.  Burst-error-correcting array codes , 1982 .