RUS  ENG
Full version
JOURNALS // Problemy Peredachi Informatsii // Archive

Probl. Peredachi Inf., 1999 Volume 35, Issue 3, Pages 18–39 (Mi ppi450)

This article is cited in 41 papers

Coding Theory

Weighted Modules and Representations of Codes

A. A. Nechaev, T. Khonol'd


Abstract: A weight on a finite module is called egalitarian if the average weights of elements of any two its nonzero submodules are equal and it is called homogeneous if in addition the weights of any two associated elements are equal. The criteria of the existence of the egalitarian and homogeneous weights on an arbitrary finite module and the description of possible homogeneous weights are given. These results generalize the analogous results of Constantinescu and Heise for the ring $\mathbb Z_m$. Those finite modules which admit a homogeneous weight are called weighted and characterized in terms of the composition factors of their socle. A homogeneous weight in terms of Möbius and Euler functions for finite modules is described and effectively calculated. As an application, besides the known presentation of the generalized Kerdock code, also isometric representations of the Golay codes and the generalized Reed–Muller codes as short linear codes over modules are given.

UDC: 621.391.15

Received: 09.06.1998


 English version:
Problems of Information Transmission, 1999, 35:3, 205–223

Bibliographic databases:


© Steklov Math. Inst. of RAS, 2024