Abstract: Let S be a subset of the Boolean cube that is both an antichain and a distance-2r+1 code. How large can S be? I will describe the answer to this question and link it to combinatorial proofs of anticoncentration inequalities for sums of random variables. Joint work with Xiaoyu He, Bhargav Narayanan, and Sam Spiro.