Pages that link to "Item:Q1322412"
From MaRDI portal
The following pages link to Packing and decomposition problems for polynomial association schemes (Q1322412):
Displaying 4 items.
- On upper bounds for code distance and covering radius of designs in polynomial metric spaces (Q1805056) (← links)
- A simple proof of main inequalities for fundamental parameters of codes in polynomial association schemes (Q1814658) (← links)
- Association schemes and coding theory (Q4701199) (← links)
- Decomposition of Multiple Packings with Subquadratic Union Complexity (Q5364271) (← links)