Linear programming bounds for codes via a covering argument (Q1017926): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Michael I. Navon / rank
Normal rank
 
Property / author
 
Property / author: Michael I. Navon / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2010992853 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: math/0702425 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optima of dual integer linear programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fast and simple randomized parallel algorithm for the maximal independent set problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On relations between covering radius and dual distance / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3218140 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4342497 / rank
 
Normal rank
Property / cites work
 
Property / cites work: New upper bounds on sphere packings. I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5707657 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized Alon--Boppana Theorems and Error-Correcting Codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the ratio of optimal integral and fractional covers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4146667 / rank
 
Normal rank
Property / cites work
 
Property / cites work: New upper bounds on the rate of a code via the Delsarte-MacWilliams inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear programming bounds for codes via a covering argument / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4230829 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An upper bound on the covering radius as a function of the dual distance / rank
 
Normal rank

Latest revision as of 14:23, 1 July 2024

scientific article
Language Label Description Also known as
English
Linear programming bounds for codes via a covering argument
scientific article

    Statements

    Linear programming bounds for codes via a covering argument (English)
    0 references
    0 references
    0 references
    13 May 2009
    0 references
    0 references
    0 references
    0 references
    0 references
    linear programming bounds for codes
    0 references
    discrete Fourier transform
    0 references
    0 references
    0 references