Forbidden intersections for codes
From MaRDI portal
Publication:6139795
DOI10.1112/jlms.12801zbMath1529.05153arXiv2103.05050OpenAlexW3134778603MaRDI QIDQ6139795
Peter Keevash, Eoin Long, Dor Minzer, Noam Lifshitz
Publication date: 19 December 2023
Published in: Journal of the London Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2103.05050
Related Items (1)
Cites Work
- Unnamed Item
- A structure theorem for Boolean functions with small total influences
- Turán problems and shadows. I: Paths and cycles
- The complete intersection theorem for systems of finite sets
- Invitation to intersection problems for finite sets
- Noise stability of functions with low influences: invariance and optimality
- Forbidding just one intersection
- Some intersection theorems for ordered sets and graphs
- The diametric theorem in Hamming spaces---optimal anticodes
- Stability versions of Erdős-Ko-Rado type theorems via isoperimetry
- Cross-intersecting families of vectors
- Gaussian bounds for noise correlation of functions
- Frankl-Rödl-type theorems for codes and permutations
- A survey of Turán problems for expansions
- INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
- Intersecting Families are Essentially Contained in Juntas
- Forbidden Intersections
- [https://portal.mardi4nfdi.de/wiki/Publication:4645045 Product Space Models of Correlation: Between Noise Stability and Additive Combinatorics]
- The Erdös-Ko-Rado Theorem for Integer Sequences
- 2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS)
- Analysis of Boolean Functions
- The Erdős-Ko-Rado theorem for integer sequences
This page was built for publication: Forbidden intersections for codes