메뉴 건너뛰기




Volumn 102, Issue 1, 2003, Pages 204-206

An improved upper bound for the football pool problem for nine matches

Author keywords

Automorphism group; Covering code; Football pool problem

Indexed keywords


EID: 0038706476     PISSN: 00973165     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0097-3165(03)00010-4     Document Type: Article
Times cited : (1)

References (5)
  • 2
    • 0037899363 scopus 로고    scopus 로고
    • Some new lower bounds for ternary covering codes
    • (electronic)
    • L. Habsieger, Some new lower bounds for ternary covering codes, Electron. J. Combin. 3 (2) (1996) R23 (electronic).
    • (1996) Electron. J. Combin. , vol.3 , Issue.2
    • Habsieger, L.1
  • 3
    • 0000952108 scopus 로고
    • The football pool problem for 5 matches
    • H.J.L. Kamps, J.H. van Lint, The football pool problem for 5 matches, J. Combin. Theory 3 (1967) 315-325.
    • (1967) J. Combin. Theory , vol.3 , pp. 315-325
    • Kamps, H.J.L.1    van Lint, J.H.2
  • 4
    • 0037561293 scopus 로고    scopus 로고
    • The football pool problem
    • P.R.J. Östergård, The football pool problem, Congr. Numer. 114 (1996) 33-43.
    • (1996) Congr. Numer. , vol.114 , pp. 33-43
    • Östergård, P.R.J.1
  • 5
    • 0037899369 scopus 로고    scopus 로고
    • Constructing covering codes by tabu search
    • P.R.J. Östergård, Constructing covering codes by tabu search, J. Combin. Des. 5 (1997) 71-80.
    • (1997) J. Combin. Des. , vol.5 , pp. 71-80
    • Östergård, P.R.J.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.