The extension problem for Lee and Euclidean weights
Keywords:
Extension problem, Lee weight, Euclidean weight, Egalitarian weightAbstract
The extension problem is solved for the Lee and Euclidean weights over three families of rings of the form $\Z/N\Z$: $N=2^{\ell + 1}$, $N=3^{\ell + 1}$, or $N=p=2q+1$ with $p$ and $q$ prime. The extension problem is solved for the Euclidean PSK weight over $\Z/N\Z$ for all $N$.
Downloads
References
A. Barra, Equivalence Theorems and the Local–Global Property, Ph.D. Dissertation, University of Kentucky, 2013.
A. Barra and H. Gluesing-Luerssen, MacWilliams extension theorems and the local–global property for codes over Frobenius rings, J. Pure Appl. Algebra 219(4) (2015) 703–728.
S. Dyshko, P. Langevin, and J. A. Wood, Deux analogues au déterminant de Maillet, C. R. Math. Acad. Sci. Paris 354(7) (2016) 653–657.
F. G. Frobenius, Gesammelte Abhandlungen, Springer–Verlag, Berlin, Heidelberg, 1968.
M. Greferath, T. Honold, C. McFadden, J. A. Wood, and J. Zumbrägel, MacWilliams’ Extension Theorem for bi-invariant weights over finite Frobenius rings, J. Combin. Theory Ser. A 125 (2014) 177–193.
M. Greferath, C. McFadden, and J. Zumbrägel, Characteristics of invariant weights related to code equivalence over finite rings, Des. Codes Cryptogr. 66(1–3) (2013) 219–227.
M. Greferath and S. E. Schmidt, Finite–ring combinatorics and MacWilliams’ Equivalence Theorem, J. Combin. Theory Ser. A 92(1) (2000) 17–28.
W. Heise and T. Honold, Homogeneous and egalitarian weights on finite rings, in: Proceedings of the 7th International Workshop on Algebraic and Combinatorial Coding Theory (ACCT-7), Bansko, Bulgaria, 2000, pp. 183–188.
T. Honold, Characterization of finite Frobenius rings, Arch. Math. (Basel) 76(6) (2001) 406–415.
K. Ireland and M. Rosen, A Classical Introduction to Modern Number Theory, 2nd ed., Graduate Texts in Mathematics, vol. 84, Springer–Verlag, New York, 1990.
J. A. Wood, Extension theorems for linear codes over finite rings, in: T. Mora and H. Stichtenoth (Eds.), Applied Algebra, Algebraic Algorithms and Error-Correcting Codes (AAECC-12), Lecture Notes in Computer Science, vol. 1255, Springer, Berlin, Heidelberg, 1997, pp. 329–340.
J. A. Wood, Duality for modules over finite rings and applications to coding theory, Amer. J. Math. 121(3) (1999) 555–575.
J. A. Wood, Weight functions and the extension theorem for linear codes over Frobenius rings, in: Finite Fields: Theory, Applications, and Algorithms, Contemporary Mathematics, vol. 225, American Mathematical Society, Providence, RI, 1999, pp. 231–243.
J. A. Wood, Factoring the semigroup determinant of a finite chain ring, in: Codes and Association Schemes, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 56, American Mathematical Society, Providence, RI, 2001, pp. 249–259.
J. A. Wood, The structure of linear codes of constant weight, Trans. Amer. Math. Soc. 354(3) (2002) 1007–1026.
J. A. Wood, Foundations of linear codes defined over finite modules: The extension theorem and the MacWilliams identities, in: Codes Over Rings, Series on Coding Theory and Cryptology, vol. 6, World Scientific, Hackensack, NJ, 2009, pp. 124–190.
J. A. Wood, Applications of finite Frobenius rings to the foundations of algebraic coding theory, in: Proceedings of the 44th Symposium on Ring Theory and Representation Theory, Nagoya, 2012, pp. 223–245.
J. A. Wood, Relative one–weight linear codes, Des. Codes Cryptogr. 72(2) (2014) 431–444.
