Pages that link to "Item:Q1066907"

The following pages link to On a pair of dual subschemes of the Hamming scheme \(H_ n(q)\) (Q1066907):

Displayed 11 items.

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