×

CT bursts-from classical to array coding. (English) Zbl 1143.94018

In this paper the CT bursts in \(m\)-metric array codes are introduced, generalizing both the bursts considered in [Linear Algebra Appl. 418, No. 1, 130–141 (2006; Zbl 1103.94026)] and the CT bursts for classical coding system defined by Chien and Tang [IBM J. Res. Develop. 9, 292–293 (1965)]. Also some bounds are obtained on the parameters for the detection and correction of CT burns in \(m\)-metric array codes. These are analogous to classical bounds given by S. H. Reider [Trans. IRE IT-6, 16–21 (1960)].

MSC:

94B05 Linear codes (general theory)
94B60 Other types of codes

Citations:

Zbl 1103.94026
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] Alxendar, A. A.; Gryb, R. M.; Nast, D. W., Capabilities of the telephone network for data transmission, Bell System Technical J., 39 (1960)
[2] Blaum, M.; Farrell, P. G.; van Tilborg, H. C.A., Array codes, (Pless, V. S.; Huffman, W. C., Handbook of Coding Theory, vol. II (1998), Elsevier: Elsevier North-Holland, Amsterdam), 1855-1909 · Zbl 0978.94044
[3] Campopiano, C. N., Bounds on burst error correcting codes, IRE Trans., IT-8, 257-259 (1962) · Zbl 0105.32901
[4] Chien, R. T.; Tang, D. T., On definition of a burst, IBM J. Res. Develop., 9, 292-293 (1965)
[5] Dougherty, S. T.; Skriganov, M. M., MacWilliams duality and the Rosenbloom-Tsfasman metric, Moscow Math. J., 2, 83-99 (2002) · Zbl 1024.94012
[6] Dougherty, S. T.; Skriganov, M. M., Maximum distance separable codes in the \(\rho \)-metric over arbitrary alphabets, J. Algebraic Combin., 16, 71-81 (2002) · Zbl 1020.94031
[7] P. Fire, A class of multiple-error-correcting binary codes for non-independent errors, Sylvania Reports RSL-E-2, Sylvania Reconnaissance Systems, Mountain View, CA, 1959.; P. Fire, A class of multiple-error-correcting binary codes for non-independent errors, Sylvania Reports RSL-E-2, Sylvania Reconnaissance Systems, Mountain View, CA, 1959.
[8] E.M. Gabidulin, V.V. Zanin, Matrix codes correcting array errors of size \(2 \times 2\), in: International Symposium on Communication Theory and Applications, Ambleside, UK, 11-16 June 1993.; E.M. Gabidulin, V.V. Zanin, Matrix codes correcting array errors of size \(2 \times 2\), in: International Symposium on Communication Theory and Applications, Ambleside, UK, 11-16 June 1993.
[9] Jain, S., Bursts in \(m\)-metric array codes, Linear Algebra Appl., 418, 130-141 (2006) · Zbl 1103.94026
[10] Jain, S., Campopiano-type bounds in non-hamming array coding, Linear Algebra Appl., 420, 135-159 (2007) · Zbl 1130.94334
[11] S. Jain, An algorithmic approach to achieve minimum \(\operatorname{Ρ;} \)-distance at least \(d\) in linear array codes, communicated.; S. Jain, An algorithmic approach to achieve minimum \(\operatorname{Ρ;} \)-distance at least \(d\) in linear array codes, communicated. · Zbl 1149.94013
[12] Peterson, W. W.; Weldon, E. J., Error Correcting Codes (1972), MIT Press: MIT Press Cambridge, MA · Zbl 0251.94007
[13] Reiger, S. H., Codes for the correction of clustered errors, IRE Trans., IT-6, 16-21 (1960)
[14] Rosenbloom, M. Yu.; Tsfasman, M. A., Codes for \(m\)-metric, Problems Inform. Transmission, 33, 45-52 (1997) · Zbl 1037.94545
[15] I. Siap, The complete weight enumerator for codes over \(M_{m \times s}( F_q)\), in: Lecture Notes in Computer Sciences, vol. 2260, 2001, pp. 20-26.; I. Siap, The complete weight enumerator for codes over \(M_{m \times s}( F_q)\), in: Lecture Notes in Computer Sciences, vol. 2260, 2001, pp. 20-26. · Zbl 0999.94561
[16] Siap, I., A MacWilliams type identity, Turk. J. Math., 26, 465-473 (2002) · Zbl 1017.94014
[17] Voukalis, D. C., A new series of concatenated codes subject to matrix type-\(B\) codes, IEEE. Trans. Inform. Theory, IT-28, 522 (1982) · Zbl 0479.94022
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.