Antichain codes

DOI10.1112/BLMS.12909zbMath1529.05152arXiv2212.08406MaRDI QIDQ6139014

Sam Spiro, Xiaoyu He, Bhargav P. Narayanan, Benjamin Gunby

Publication date: 18 December 2023

Published in: Bulletin of the London Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2212.08406

zbMATH Keywords

Littlewood-Offord theoryHálasz's theorem

Mathematics Subject Classification ID

Random matrices (probabilistic aspects) (60B20) Permutations, words, matrices (05A05) Extremal set theory (05D05) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Asymptotic enumeration (05A16)

Cites Work

• Unnamed Item
• Unnamed Item
• Weyl Groups, the Hard Lefschetz Theorem, and the Sperner Property
• Estimates for the concentration function of combinatorial number theory and probability
• On the Probability That a Random ± 1-Matrix Is Singular
• On the counting problem in inverse Littlewood–Offord theory
• Über ein Problem von Erdös und Moser
• On a lemma of Littlewood and Offord

This page was built for publication: Antichain codes