Forbidden intersections for codes
Forbidden intersections for codes
Abstract Determining the maximum size of a ‐intersecting code in was a longstanding open problem of Frankl and Füredi, solved independently by Ahlswede and Khachatrian and by Frankl and Tokushige. We extend their result to the setting of forbidden intersections, by showing that for any and large compared with (but …