On \(r\)-partition designs in Hamming spaces
DOI10.1007/BF01294330zbMath0756.05036OpenAlexW1965654032MaRDI QIDQ1189713
Bernard Courteau, Paul Camion, Philippe Delsarte
Publication date: 27 September 1992
Published in: Applicable Algebra in Engineering, Communication and Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01294330
completely regular codesdifference setscodecombinatorial matrixcoherent configurationsHamming spaces\(r\)-partition designdistance distribution matrixHamming association schemesregularity number
Association schemes, strongly regular graphs (05E30) Other designs, configurations (05B30) Combinatorial aspects of difference sets (number-theoretic, group-theoretic, etc.) (05B10) Other types of codes (94B60)
Related Items (12)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Coherent configurations. I: Ordinary representation theory
- Partial difference sets and partially balanced weighing designs for calibration and tournaments
- Etude De Certains Paramètres Associés à Un Code Linéaire
- Weight Distribution of Translates of Linear Codes and Generalized Pless Indentities
- A characterization of N-weight projective codes (Corresp.)
- Four fundamental parameters of a code and their combinatorial significance
- A survey of perfect codes
This page was built for publication: On \(r\)-partition designs in Hamming spaces