The diametric theorem in Hamming spaces---optimal anticodes

DOI10.1006/aama.1998.0588zbMath0909.05044OpenAlexW1992472342MaRDI QIDQ1271885

Levon H. Khachatrian

Publication date: 12 January 1999

Published in: Advances in Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/aama.1998.0588

zbMATH Keywords

Erdős-Ko-Rado theoremanticodesHamming space\(t\)-intersecting set systemsthe complete intersection theorem of Ahlswede and Khachatrian

Mathematics Subject Classification ID

Extremal set theory (05D05)

Related Items (55)

Anticodes in the sum-rank metric ⋮ The maximum product of sizes of cross-intersecting families ⋮ Intersection problems in the \(q\)-ary cube ⋮ More complete intersection theorems ⋮ The weighted complete intersection theorem ⋮ Intersection theorems under dimension constraints ⋮ The Katona cycle proof of the Erdős-Ko-Rado theorem and its possibilities ⋮ Non-existence of a ternary constant weight \((16,5,15;2048)\) diameter perfect code ⋮ Multiply-intersecting families revisited ⋮ Application of hypergraph Hoffman's bound to intersecting families ⋮ Models of multi-user write-efficient memories and general diametric theorems ⋮ Cross-Intersecting Families of Vectors ⋮ An analogue of the Erdős-Ko-Rado theorem for weak compositions ⋮ Hypercontractivity for global functions and sharp thresholds ⋮ An Erdős-Ko-Rado theorem for permutations with fixed number of cycles ⋮ r$r$‐Cross t$t$‐intersecting families via necessary intersection points ⋮ The maximum measure of non-trivial 3-wise intersecting families ⋮ The maximum product of weights of cross-intersecting families ⋮ A non-trivial intersection theorem for permutations with fixed number of cycles ⋮ Forbidden intersections for codes ⋮ Strong stability of 3-wise \(t\)-intersecting families ⋮ Non-trivially intersecting multi-part families ⋮ The maximum measure of 3-wise \(t\)-intersecting families ⋮ On cross \(t\)-intersecting families of sets ⋮ An Erdős-Ko-Rado theorem for cross \(t\)-intersecting families ⋮ A Diametric Theorem in ${\mathbb Z}^n_m$ for Lee and Related Distances ⋮ The edge-diametric theorem in Hamming spaces ⋮ A sharp bound for the product of weights of cross-intersecting families ⋮ On robust colorings of Hamming-distance graphs ⋮ Towards extending the Ahlswede-Khachatrian theorem to cross \(t\)-intersecting families ⋮ A multiply intersecting Erdős-Ko-Rado theorem -- the principal case ⋮ Multiple cross-intersecting families of signed sets ⋮ Some Erdős-Ko-Rado theorems for injections ⋮ An Erdős-Ko-Rado theorem for unions of length 2 paths ⋮ Optimal permutation anticodes with the infinity norm via permanents of \((0,1)\)-matrices ⋮ Intersecting families, signed sets, and injection ⋮ Friedgut--Kalai--Naor theorem for slices of the Boolean cube ⋮ The maximum sum and the maximum product of sizes of cross-intersecting families ⋮ Strongly intersecting integer partitions ⋮ On subsets of the hypercube with prescribed Hamming distances ⋮ Erdős-Ko-Rado theorems for set partitions with certain block size ⋮ Fundamentals of coding type problems ⋮ On \(t\)-intersecting families of signed sets and permutations ⋮ Intersection theorem for finite permutations ⋮ Frankl-Rödl-type theorems for codes and permutations ⋮ AK-type stability theorems on cross \(t\)-intersecting families ⋮ Cross t-Intersecting Integer Sequences from Weighted Erdős–Ko–Rado ⋮ Unnamed Item ⋮ A Deza-Frankl type theorem for set partitions ⋮ Cross-intersecting families of vectors ⋮ A discrete isodiametric result: the Erdős-Ko-Rado theorem for multisets ⋮ The Edge-Diametric Theorem in Hamming Spaces ⋮ An extension of the Erdős–Ko–Rado Theorem ⋮ The \(t\)-intersection problem in the truncated Boolean lattice ⋮ Optimal tristance anticodes in certain graphs

Cites Work

• Unnamed Item
• Unnamed Item
• An ordered version of the Erdős-Ko-Rado theorem
• The exact bound in the Erdős-Ko-Rado theorem
• An analogue of the Erdoes-Ko-Rado theorem for the Hamming schemes H(n,q)
• Diametric theorems in sequence spaces
• Contributions to the geometry of Hamming spaces
• The complete nontrivial-intersection theorem for systems of finite sets
• INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• Intersection theorems for systems of finite sets
• On a combinatorial conjecture of Erdös

This page was built for publication: The diametric theorem in Hamming spaces---optimal anticodes