Frankl-Rödl-type theorems for codes and permutations (Q2833012): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2964212244 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1402.6294 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The diametric theorem in Hamming spaces---optimal anticodes / rank
 
Normal rank
Property / cites work
 
Property / cites work: On sunflowers and matrix multiplication / rank
 
Normal rank
Property / cites work
 
Property / cites work: Compressions and isoperimetric inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new proof of several inequalities on codes and sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: The three primes theorem with almost equal summands / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4542521 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the maximum number of permutations with given maximal or minimal distance / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4101818 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Forbidding just one intersection, for permutations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dependent random choice / rank
 
Normal rank
Property / cites work
 
Property / cites work: Orthogonal vectors in the \(n\)-dimensional cube and codes with missing distances / rank
 
Normal rank
Property / cites work
 
Property / cites work: On hypergraphs without two edges intersecting in a given number of vertices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Forbidden Intersections / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Partition Property of Simplices in Euclidean Space / rank
 
Normal rank
Property / cites work
 
Property / cites work: Intersection theorems with geometric consequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Intersection theorems for systems of finite sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: On an isoperimetric problem for Hamming graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Specified intersections / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds on pairs of families with restricted intersections / rank
 
Normal rank

Latest revision as of 23:37, 12 July 2024

scientific article
Language Label Description Also known as
English
Frankl-Rödl-type theorems for codes and permutations
scientific article

    Statements

    Frankl-Rödl-type theorems for codes and permutations (English)
    0 references
    0 references
    0 references
    16 November 2016
    0 references
    codes with forbidden distances
    0 references
    forbidden intersections
    0 references
    probabilistic method of dependent random choice
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references