On a pair of dual subschemes of the Hamming scheme \(H_ n(q)\)

DOI10.1016/S0195-6698(85)80004-4zbMath0579.05021OpenAlexW1988802300MaRDI QIDQ1066907

Jean-Marie Goethals, Robert Calderbank

Publication date: 1985

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

Full work available at URL: https://doi.org/10.1016/s0195-6698(85)80004-4

zbMATH Keywords

association schemecodesHamming scheme

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Other designs, configurations (05B30)

Related Items (11)

Quotients of association schemes ⋮ Completely regular codes and completely transitive codes ⋮ On completely regular codes ⋮ Diameter, covering index, covering radius and eigenvalues ⋮ All \(s\)-sum sets of type 2 or 3 are triple-sum sets ⋮ The performance of an eigenvalue bound on the max-cut problem in some classes of graphs ⋮ Dual distances of completely regular codes ⋮ A new distance-regular graph of diameter 3 on 1024 vertices ⋮ Metric coset schemes revisited ⋮ Three-class association schemes ⋮ A class of codes admitting at most three nonzero dual distances

Cites Work

• Two-error correcting Bose-Chaudhuri codes are quasi-perfect
• On Uniformly Packed [n , n -k , 4 Codes over GF(q ) and a Class of Caps in PG(k -1, q )]
• The Geometry of Two-Weight Codes
• Binary Codes Which Are Ideals in the Group Algebra of an Abelian Group
• A survey of perfect codes
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On a pair of dual subschemes of the Hamming scheme \(H_ n(q)\)