Abstract
We consider linear composite codes based on the |a+x|b+x|a+b+x| construction. For m ≥ 3 and r ≤ 4m + 3, we propose a class of linear composite [3 · 2m, 3 · 2m − r, 8] codes, which includes the [24,12,8] extended Golay code. We describe an algebraic decoding algorithm, which is valid for any odd m, and a simplified version of this algorithm, which can be applied for decoding the Golay code. We give an estimate for the combinational-circuit decoding complexity of the Golay code. We show that, along with correction of triple independent errors, composite codes with minimum distance 8 can also correct single cyclic error bursts and two-dimensional error bytes.
Similar content being viewed by others
REFERENCES
MacWilliams, F.J. and Sloane, N.J.A., The Theory of Error-Correcting Codes, Amsterdam: North-Holland, 1977. Translated under the title Teoriya kodov, ispravlyayuschikh oshibki, Moscow: Svyaz, 1979.
Sloane, N.J.A., Reddy, S.M., and Chen C.-L., New Binary Codes, IEEE Trans. Inf. Theory, 1972, vol. 18, no. 4, pp. 503–510.
Fossorier, M.P.C. and Lin, S., Some Decomposable Codes: The |a + x | b + x | a + b + x| Construction, IEEE Trans. Inf. Theory, 1997, vol. 43, no. 5, pp. 1663–1667.
Forney, G.D., Coset Codes II: Binary Lattices and Related Codes, IEEE Trans. Inf. Theory, 1988, vol. 34, no. 6, pp. 1152–1187.
Zinoviev, V.A. and Zyablov, V.V., Correction of Error Bursts and Independent Errors using Generalized Concatenated Codes, Probl. Peredachi Inf., 1979, vol. 15, no. 2, pp. 58–70 [Probl. Inf. Trans. (Engl. Transl.), 1979, vol. 15, no. 2, pp. 125–134].
Boyarinov, I.M., Method of Decoding Direct Sums of Products of Codes and Its Applications, Probl. Peredachi Inf., 1981, vol. 17, no. 2, pp. 39–51 [Probl. Inf. Trans. (Engl. Transl.), 1981, vol. 17, no. 2, pp. 104–113].
Honary, B., Markarian, G., and Farrell, P., Generalized Array Codes and Their Trellis Structure, Electronics Letters, 1993, vol. 29, no. 6, pp. 541–542.
MacWilliams, F.J., Permutation Decoding of Systematic Codes, Bell. Syst. Tech. J., 1964, vol. 43, no. 4, pp. 485–505.
Gordon, D.M., Minimal Permutation Sets for Decoding the Binary Golay Codes, IEEE Trans. Inf. Theory, 1982, vol. 28, no. 3, pp. 541–543.
Wolfman, J., A Permutation Decoding of the (24; 12; 8) Golay Code, IEEE Trans. Inf. Theory, 1983, vol. 29, no. 5, pp. 748–750.
Kasami, T., A Decoding Procedure for Multiple-Error-Correcting Cyclic Codes IEEE Trans. Inf. Theory, 1964, vol. 10, no. 1, pp. 134–139.
Reed, I.S., Yin, X., Truong, T.K., and Holmes, J.K., Decoding the (24, 12, 8) Golay Code, IEE Proc., 1990, vol. 137, no. 3, pp. 202–206.
Pless, V., Decoding the Golay Codes, IEEE Trans. Inf. Theory, 1986, vol. 32, no. 4, pp. 561–567.
Vardy, A., Even More Efficient Bounded Distance Decoding of the Hexacode, the Golay Code, and the Leech Lattice, IEEE Trans. Inf. Theory, 1995, vol. 41, no. 5, pp. 1495–1499.
Dodunekov, S.M., Zinoviev, V.A., and Nilsson, J.E.M., On Algebraic Decoding of Some Maximal Quaternary Codes and the Binary Golay Code, Probl. Peredachi Inf., 1999, vol. 35, no. 4, pp. 59–67 [Probl. Inf. Trans. (Engl. Transl.), 1999, vol. 35, no. 4, pp. 338–345].
Goethals, J.-M., On the Golay Perfect Binary Code, J. Combinat. Theory, 1971, vol. 11, no. 1, pp. 178–186.
Elia, M., Algebraic Decoding of the (23; 12; 7) Golay Code, IEEE Trans. Inf. Theory, 1987, vol. 33, no. 1, pp. 150–151.
Blaum, M. and Bruck, J., Decoding the Golay Code with Venn Diagrams, IEEE Trans. Inf. Theory, 1990, vol. 36, no. 4, pp. 906–910.
Boyarinov, I., Martin, I., and Honary, B., A Simple Decoding Algorithm for the [24, 12, 8] Extended Golay Code, Proc. 2000 IEEE Int. Sympos. on Information Theory, Sorrento, Italy, 2000, p. 334.
Boyarinov, I., Martin, I., and Honary, B., High-Speed Decoding of Extended Golay Code, IEE Proc. Commun., 2000, vol. 147, no. 6, pp. 333–336.
Rights and permissions
About this article
Cite this article
Boyarinov, I.M., Martin, I. & Honary, B. A Class of Composite Codes with Minimum Distance 8. Problems of Information Transmission 37, 353–364 (2001). https://doi.org/10.1023/A:1013827518409
Issue Date:
DOI: https://doi.org/10.1023/A:1013827518409