• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.8C
• /
• pp.765-770
• /
• 2003

In this paper, the complete weight enumerator of the Delsarte-Goethals code over Z$_4$ is obtained. This code is divided into 3 cases and the complete weight enumerator of each case is calculated. During this weight enumeration, the blown distribution of exponential sums and binary weight distribution of the sub-codes are used. By combining this result and MacWilliams identity, the complete weight enumerator of the Goethals code over Z$_4$can be easily obtained. This result is also used for finding 3-designs from the Goethals and Delsarte-Goethals codes over Z$_4$.

• Journal of applied mathematics & informatics
• /
• v.26 no.1_2
• /
• pp.107-120
• /
• 2008

There has been a recent growth of interest in codes with respect to a newly defined non-Hamming metric grown as the Rosenbloom-Tsfasman metric (RT, or $\rho$, in short). In this paper, the definitions of the Lee complete $\rho$ weight enumerator and the exact complete $\rho$ weight enumerator of a code over $M_n_\times_s(Z_4)$ are given, and the MacWilliams identities with respect to this RT metric for the two weight enumerators of a linear code over $M_n_\times_s(Z_4)$ are proven too. At last, we also prove that the MacWilliams identities for the Lee and exact complete $\rho$ weight enumerators of a linear code over $M_n_\times_s(Z_4)$ are the generalizations of the MacWilliams identities for the Lee and complete weight enumerators of the corresponding code over $Z_4$.

• Bulletin of the Korean Mathematical Society
• /
• v.37 no.3
• /
• pp.493-505
• /
• 2000

We discuss the class of projective systems whose supports are the complement of the union of two linear subspaces in general position. We express the weight enumerators of the codes generated by these projective systems using two simplex codes corresponding to given linear subspaces. We also prove these codes are uniquely determined upto equivalence by their weight enumerators.

• Bulletin of the Korean Mathematical Society
• /
• v.38 no.4
• /
• pp.689-699
• /
• 2001

We discuss the class of projective systems whose supports are the complement of the union of three linear subspaces in general position. We proves these codes are uniquely dtermined up to equivalence by their weight enumerators. Our result is a generalization of the result given in [1].

• Bulletin of the Korean Mathematical Society
• /
• v.52 no.3
• /
• pp.809-823
• /
• 2015

This paper is devoted to presenting a MacWilliams type identity for m-spotty RT weight enumerators of byte error control codes over finite commutative Frobenius rings, which can be used to determine the error-detecting and error-correcting capabilities of a code. This provides the relation between the m-spotty RT weight enumerator of the code and that of the dual code. We conclude the paper by giving three illustrations of the results.

• Journal of the Korean Mathematical Society
• /
• v.50 no.3
• /
• pp.509-527
• /
• 2013

A Krawtchouk polynomial is introduced as the classical Mac-Williams identity, which can be expressed in weight-enumerator-free form of a linear code and its dual code over a Hamming scheme. In this paper we find a new explicit expression for the $p$-number and the $q$-number, which are more generalized notions of the Krawtchouk polynomial in the P-polynomial schemes by using an extended version of a discrete Green's function. As corollaries, we obtain a new expression of the Krawtchouk polynomial over the Hamming scheme and the Eberlein polynomial over the Johnson scheme. Furthermore, we find another version of the MacWilliams identity over a Hamming scheme.