Frankl-Rödl-type theorems for codes and permutations
We give a new proof of the Frankl-Rödl theorem on forbidden intersections, via the probabilistic method of dependent random choice. Our method extends to codes with forbidden distances, where over large alphabets our bound is significantly better than that obtained by Frankl and Rödl. We also apply...
| Main Authors: | , |
|---|---|
| Format: | Journal article |
| Published: |
American Mathematical Society
2016
|