On the parameters of codes for the Lee and modular distance

DOI10.1016/0012-365X(91)90366-AzbMath0755.05100OpenAlexW2002993524MaRDI QIDQ1176746

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 radiusself-dual codesexternal distancemodular distanceweakly metric association scheme

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the covering radius of cyclic linear codes and arithmetic codes
• Classification of graphs by regularity
• Self-dual codes over GF(5)
• A necessary condition for the existence of perfect codes in Lie metric
• Perfect codes in graphs
• Covering radius---Survey and recent results
• On modular weight and cyclic nonadjacent forms for arithmetic codes (Corresp.)
• Four fundamental parameters of a code and their combinatorial significance
• A Characterization of Certain Ptolemaic Graphs

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