Packing and decomposition problems for polynomial association schemes

DOI10.1006/EUJC.1993.1049zbMath0794.05134OpenAlexW1969505015MaRDI QIDQ1322412

Vladimir I. Levenshtein

Publication date: 28 August 1994

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

Full work available at URL: https://doi.org/10.1006/eujc.1993.1049

zbMATH Keywords

polynomial metric spacesDelsarte codesantipodal schemesdecomposable schemespacking boundspolynomial association schemes

Mathematics Subject Classification ID

Association schemes, strongly regular graphs (05E30)

Related Items (1)

On upper bounds for code distance and covering radius of designs in polynomial metric spaces

This page was built for publication: Packing and decomposition problems for polynomial association schemes