On the parameters of codes for the Lee and modular distance

DOI10.1016/0012-365X(91)90366-AMaRDI QIDQ1176746zbMATH OpenOpenAlexFDO

Authors Patrick Solé

Publication date 25 June 1992

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0012-365x(91)90366-a

zbMATH Keywords

completely regular codescovering radiusexternal distancemodular distanceself-dual codesweakly metric association scheme

Mathematics Subject Classification ID

Association schemes, strongly regular graphs (05E30) Theory of error-correcting codes and error-detecting codes (94B99)

Review text

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.

Recommendations

• A simple proof of main inequalities for fundamental parameters of codes in polynomial association schemes
• scientific article; zbMATH DE number 3272069
• Perfect codes with respect to Lee metric
• On some perfect codes with respect to Lee metric
• On maximum Lee distance codes

Cites work

• A Characterization of Certain Ptolemaic Graphs
• A necessary condition for the existence of perfect codes in Lie metric
• Classification of graphs by regularity
• Covering radius---Survey and recent results
• Four fundamental parameters of a code and their combinatorial significance
• scientific article; zbMATH DE number 3884178 (Why is no real title available?)
• scientific article; zbMATH DE number 3763833 (Why is no real title available?)
• scientific article; zbMATH DE number 3492558 (Why is no real title available?)
• scientific article; zbMATH DE number 3577144 (Why is no real title available?)
• scientific article; zbMATH DE number 3799566 (Why is no real title available?)
• scientific article; zbMATH DE number 3318360 (Why is no real title available?)
• scientific article; zbMATH DE number 3349863 (Why is no real title available?)
• scientific article; zbMATH DE number 3397423 (Why is no real title available?)
• On modular weight and cyclic nonadjacent forms for arithmetic codes (Corresp.)
• On the covering radius of cyclic linear codes and arithmetic codes
• Perfect codes in graphs
• Self-dual codes over GF(5)

Cited in

(2)

• Lower bounds on the minimum distance of long codes in the Lee metric
• A generalization of the Lee distance and error correcting codes

This page was built for publication: On the parameters of codes for the Lee and modular distance

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1176746)