The following pages link to More coverings by rook domains (Q789394):
Displaying 21 items.
- Linear maps of perfect codes and irregular \(C\)-partitions (Q482221) (← links)
- On kernels of perfect codes (Q710614) (← links)
- The covering problem in Rosenbloom-Tsfasman spaces (Q888588) (← links)
- On perfect \(p\)-ary codes of length \(p+1\) (Q1008963) (← links)
- The football pool problem for 6 matches: A new upper bound obtained by simulated annealing (Q1117236) (← links)
- Bounds on packings and coverings by spheres in \(q\)-ary and mixed Hamming spaces (Q1176382) (← links)
- On lengthening of covering codes (Q1199613) (← links)
- A new upper bound for the football pool problem for nine matches (Q1208049) (← links)
- Bounds for binary multiple covering codes (Q1261015) (← links)
- New upper bounds for the football pool problem for 11 and 12 matches (Q1331131) (← links)
- On \((p,1)\)-subnormal \(q\)-ary covering codes (Q1331896) (← links)
- Graph domination, tabu search and the football pool problem (Q1356502) (← links)
- Ternary covering codes derived from BCH codes (Q1374190) (← links)
- New upper bounds for binary covering codes (Q1377844) (← links)
- A connection between sumsets and covering codes of a module (Q1785002) (← links)
- New upper bounds for the football pool problem for 6, 7, and 8 matches (Q2277164) (← links)
- Bounds for covering codes over large alphabets (Q2572977) (← links)
- Hyper-rook Domain Inequalities (Q3033776) (← links)
- Hypercube Packings and Coverings with Higher Dimensional Rooks (Q3300685) (← links)
- Projective tilings and full-rank perfect codes (Q6050257) (← links)
- Ordered covering arrays and upper bounds on covering codes (Q6086204) (← links)
