Upper bounds for football pool problems and mixed covering codes
- 31 January 1991
- journal article
- Published by Elsevier in Journal of Combinatorial Theory, Series A
- Vol. 56 (1) , 84-95
- https://doi.org/10.1016/0097-3165(91)90024-b
Abstract
No abstract availableKeywords
This publication has 18 references indexed in Scilit:
- Modified bounds for covering codesIEEE Transactions on Information Theory, 1991
- Lower bounds for q-ary covering codesIEEE Transactions on Information Theory, 1990
- On normal and subnormal q-ary codesIEEE Transactions on Information Theory, 1989
- A new construction for covering codesIEEE Transactions on Information Theory, 1988
- Lower bounds for binary covering codesIEEE Transactions on Information Theory, 1988
- From Error-Correcting Codes through Sphere Packings to Simple Groups.Mathematics of Computation, 1986
- Covering radius---Survey and recent resultsIEEE Transactions on Information Theory, 1985
- The football pool problem for 7 and 8 matchesJournal of Combinatorial Theory, Series A, 1983
- On the football pool problem for 6 matches: A new upper boundJournal of Combinatorial Theory, Series A, 1983
- COVERING THEOREMS FOR GROUPSThe Quarterly Journal of Mathematics, 1950