Pages that link to "Item:Q2277164"
From MaRDI portal
The following pages link to New upper bounds for the football pool problem for 6, 7, and 8 matches (Q2277164):
Displaying 16 items.
- Genetic algorithms in coding theory -- a table for \(A_ 3(n, d)\) (Q686527) (← links)
- Upper bounds for football pool problems and mixed covering codes (Q753795) (← links)
- Jack van Lint (1932--2004): a survey of his scientific work (Q855858) (← links)
- Simulated annealing: A tool for operational research (Q913662) (← links)
- Bounds on packings and coverings by spheres in \(q\)-ary and mixed Hamming spaces (Q1176382) (← links)
- Local search in coding theory (Q1199575) (← 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)
- Graph domination, tabu search and the football pool problem (Q1356502) (← links)
- Ternary covering codes derived from BCH codes (Q1374190) (← links)
- \(K_{5}(7,3) \leqslant 100\). (Q1421340) (← links)
- A new lower bound for the football pool problem for six matches (Q1865378) (← links)
- Construction of new codes and its related parameters (Q2832937) (← links)
- The second-order football-pool problem and the optimal rate of generalized-covering codes (Q6187334) (← links)
