Dual distances of completely regular codes

DOI10.1016/0012-365X(91)90395-IzbMath0725.94009MaRDI QIDQ2277432

André Montpetit, Bernard Courteau

Publication date: 1991

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

uniformly packed codesdual distances of completely regular codesone-error-correcting linear codes

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Association schemes, strongly regular graphs (05E30) Other designs, configurations (05B30) Other types of codes (94B60)

Related Items

On the local spectra of the subconstituents of a vertex set and completely pseudo-regular codes ⋮ Metric coset schemes revisited

Cites Work

• On a pair of dual subschemes of the Hamming scheme \(H_ n(q)\)
• Covering radius---Survey and recent results
• Four fundamental parameters of a code and their combinatorial significance
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item