On the parameters of codes for the Lee and modular distance (Q1176746): Difference between revisions

A combinatorial study of codes in a generalization of Delsarte's metric schemes called ` weakly metric association scheme' has been made in this paper. The main result of the paper is an inequality which generalizes both the Delsarte upper bound on covering radius and the MacWilliams lower bound on the external distance, yielding a strong necessary existence condition on completely regular codes. The external distance (in the Lee metric) of some self-dual codes of moderate length over \(Z_ 5\) has also been computed. An algebraic characterization of association schemes with a given \(\pi(e)\) would be of great interest. However, in the list of references at the end of the paper, reference 19 is missing.