Packing problems in Galois geometries over GF(3)

A set of kind s in the Galois space S_r,q is a set of points such that any s+1 are linearly independent but there is at least one subset of s+2 The packing problem is that of finding , the largest size of kind s in S_r,q. The main result is the evaluation of for all sr5. linearly dependent points. Some partial results bounding m^s_6,3 are also given.