Let $H_n^{(3)}$ be a 3-uniform linear hypergraph, i.e. any two edges have at most one vertex common. A special hypergraph, {\em wicket}, is formed by three rows and two columns of a $3 \times 3$ point matrix. In this note, we give a new lower bound on the Turán number of wickets using estimates on cap sets. We also show that this problem is closely connected to important questions in additive combinatorics.