Pages that link to "Item:Q1066907"
From MaRDI portal
The following pages link to On a pair of dual subschemes of the Hamming scheme \(H_ n(q)\) (Q1066907):
Displaying 22 items.
- A family of error-correcting codes (Q579221) (← links)
- A generalization of the formulas for intersection numbers of dual polar association schemes and their applications (Q624531) (← links)
- 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)
- Hyperplane codes (Q1085139) (← 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)
- Subschemes of Hamming association schemes \(H(n,q)\), \(q\geq{}4\) (Q1201910) (← links)
- Metric coset schemes revisited (Q1296146) (← links)
- Three-class association schemes (Q1296390) (← links)
- Packing and decomposition problems for polynomial association schemes (Q1322412) (← links)
- Modular invariance of the character table of the Hamming association scheme \(H(d,q)\) (Q1323870) (← links)
- Quotients of association schemes (Q1345874) (← links)
- Width and dual width of subsets in polynomial association schemes (Q1395814) (← links)
- A simple proof of main inequalities for fundamental parameters of codes in polynomial association schemes (Q1814658) (← links)
- A series of identities for the coefficients of inverse matrices on a Hamming scheme (Q1923527) (← links)
- Dual distances of completely regular codes (Q2277432) (← links)
- A new distance-regular graph of diameter 3 on 1024 vertices (Q2324787) (← links)
- (Q4284636) (← links)
- Association schemes and coding theory (Q4701199) (← links)
- On completely regular codes (Q5970864) (← links)
