Small additive quaternary codes

We determine the parameters of the optimal additive quaternary codes of length at most 12 over Z2×Z2. Equivalently, we determine how many lines one can pick in a binary projective space such that any t are independent. Or again, how many lines one can pick in a binary projective space such that no hyperplane contains more than m of them.