A Lloyd theorem in weakly metric association schemes

DOI10.1016/S0195-6698(89)80048-4zbMath0722.05061MaRDI QIDQ2641319

Patrick Solé

Publication date: 1989

Published in: European Journal of Combinatorics (Search for Journal in Brave)

zbMATH Keywords

covering radiusperfect codesdistance-regularLloyd theoremweakly metric association schemes

Mathematics Subject Classification ID

Association schemes, strongly regular graphs (05E30)

Related Items

The subconstituent algebra of an association scheme. I, Fundamentals of coding type problems, Metric coset schemes revisited

Cites Work

• Perfect codes and regular partitions in graphs and groups
• A necessary condition for the existence of perfect codes in Lie metric
• Perfect codes in graphs
• Further results on the covering radius of codes
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item