New upper bounds for the football pool problem for 11 and 12 matches (Q1331131): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0097-3165(94)90010-8 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2055765087 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3994799 / rank
 
Normal rank
Property / cites work
 
Property / cites work: More coverings by rook domains / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hyper-rook Domain Inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: The football pool problem for 7 and 8 matches / rank
 
Normal rank
Property / cites work
 
Property / cites work: Upper bounds for football pool problems and mixed covering codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unit sphere packings and coverings of the Hamming space / rank
 
Normal rank
Property / cites work
 
Property / cites work: The football pool problem for 5 matches / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5638345 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization by Simulated Annealing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3785827 / rank
 
Normal rank
Property / cites work
 
Property / cites work: New upper bounds for the football pool problem for 6, 7, and 8 matches / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3831025 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4146667 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new binary code of length 10 and covering radius 1 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Upper bounds for q-ary covering codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new approach to the covering radius of codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the football pool problem for 6 matches: A new upper bound / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some new lower bounds for binary and ternary covering codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: The football pool problem for 6 matches: A new upper bound obtained by simulated annealing / rank
 
Normal rank

Latest revision as of 17:19, 22 May 2024

scientific article
Language Label Description Also known as
English
New upper bounds for the football pool problem for 11 and 12 matches
scientific article

    Statements

    New upper bounds for the football pool problem for 11 and 12 matches (English)
    0 references
    9 July 1995
    0 references
    0 references
    0 references
    0 references
    0 references
    upper bounds
    0 references
    covering codes
    0 references
    simulated annealing
    0 references
    minimizing the number of words in a code
    0 references
    Hamming distance 1
    0 references
    football pool problem
    0 references
    0 references