×

Characteristics of invariant weights related to code equivalence over rings. (English) Zbl 1259.94068

Summary: The equivalence theorem states that, for a given weight on an alphabet, every isometry between linear codes extends to a monomial transformation of the entire space. This theorem has been proved for several weights and alphabets, including the original MacWilliams equivalence theorem for the Hamming weight on codes over finite fields. The question remains: What conditions must a weight satisfy so that the extension theorem will hold? In this paper we provide an algebraic framework for determining such conditions, generalizing the approach taken in M. Greferath and T. Honold [“Monomial extensions of isometries of linear codes. II: Invariant weight functions on \(Z_m\)”, in: Proceedings of the tenth international workshop in algebraic and combinatorial coding theory, ACCT-10, Zvenigorod, Russia, 106–111 (2006)].

MSC:

94B05 Linear codes (general theory)
11T71 Algebraic coding theory; cryptography (number-theoretic aspects)
05E99 Algebraic combinatorics
PDFBibTeX XMLCite
Full Text: DOI arXiv

References:

[1] Clark W.E., Drake D.A.: Finite chain rings. Abh. Math. Sem. Univ. Hamburg, 39, 147–153 (1973) · doi:10.1007/BF02992827
[2] Constantinescu I., Heise W.: On the concept of code-isomorphy. J. Geom. 57(1–2), 63–69 (1996) · Zbl 0924.94032 · doi:10.1007/BF01229251
[3] Constantinescu I., Heise W., Honold T.: Monomial extensions of isometries between codes over Z m . In: Proceedings of the Fifth International Workshop in Algebraic and Combinatorial Coding Theory (ACCT-5), pp. 98–104. Sozopol, Bulgaria (1996). · Zbl 0923.94029
[4] Greferath M., Honold T.: On weights allowing for MacWilliams equivalence theorem. In: Proceedings of the Fourth International Workshop in Optimal Codes and Related Topics, pp. 182–192. Pamporovo, Bulgaria (2005).
[5] Greferath M., Honold T.: Monomial extensions of isometries of linear codes II: invariant weight functions on Z m . In: Proceedings of the Tenth International Workshop in Algebraic and Combinatorial Coding Theory (ACCT-10), pp. 106–111. Zvenigorod, Russia (2006).
[6] Greferath M., Schmidt S.E.: Finite-ring combinatorics and MacWilliams’ equivalence theorem. J. Comb. Theory Ser. A 92(1), 17–28 (2000) · Zbl 1087.94022 · doi:10.1006/jcta.1999.3033
[7] Greferath M., Nechaev A., Wisbauer R.: Finite quasi-Frobenius modules and linear codes. J. Algebra Appl. 3(3), 247–272 (2004) · Zbl 1088.94023 · doi:10.1142/S0219498804000873
[8] Hammons A.R. Jr., Kumar P.V., Calderbank A.R., Sloane N.J.A., Solé P.: The $${{\(\backslash\)mathbb Z}_4}$$ -linearity of Kerdock, Preparata, Goethals, and related codes. IEEE Trans. Inf. Theory 40(2), 301–319 (1994) · Zbl 0811.94039 · doi:10.1109/18.312154
[9] MacWilliams J.: A theorem on the distribution of weights in a systematic code. Bell Syst. Tech. J. 42, 79–94 (1963) · doi:10.1002/j.1538-7305.1963.tb04003.x
[10] McDonald B.R.: Finite Rings with Identity. Marcel Dekker Inc., New York (1974) · Zbl 0294.16012
[11] Nechaev A.A.: Finite rings of principal ideals. Mat. Sb. (N.S.) 91(133), 350–366, 471 (1973)
[12] Nechaev A.A., Honold T.: Fully weighted modules and representations of codes. Problemy Peredachi Informatsii 35(3), 18–39 (1999) · Zbl 1004.94028
[13] Roman S.: Coding and Information Theory Volume 134 of Graduate Texts in Mathematics. Springer, New York (1992) · Zbl 0752.94001
[14] Stanley R.P.: Enumerative Combinatorics. Volume 1, Volume 9 of Cambridge Studies in Advanced Mathematics, 2nd edn. Cambridge University Press, Cambridge (2012) · Zbl 1247.05003
[15] Ward H.N., Wood J.A.: Characters and the equivalence of codes. J. Comb. Theory Ser. A 73(2), 348–352 (1996) · Zbl 0849.94019
[16] Wood J.A.: Extension theorems for linear codes over finite rings. In: Applied Algebra, Algebraic Algorithms and Error-Correcting Codes (Toulouse, 1997), Volume 1255 of Lecture Notes in Computer Science, pp. 329–340. Springer, Berlin (1997). · Zbl 1043.94541
[17] Wood J.A.: Duality for modules over finite rings and applications to coding theory. Am. J. Math. 121(3), 555–575 (1999) · Zbl 0968.94012 · doi:10.1353/ajm.1999.0024
[18] Wood J.A.: Factoring the semigroup determinant of a finite commutative chain ring. In: Coding Theory, Cryptography and Related Areas (Guanajuato, 1998), pp 249–259. Springer, Berlin (2000). · Zbl 1018.94027
[19] Wood J.A.: Code equivalence characterizes finite Frobenius rings. Proc. Am. Math. Soc. 136(2), 699–706 (2008) (electronic). · Zbl 1215.94080
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.