We have designed line packings that maximize the minimum distance between each pair of codewords. We compare our results with the packings presented in [1] and against the Rankin bound. Further we designed line packings that also exhibit the constant modulus property. Table below summarizes the results and links to the designed codebooks (Please see Conditions of Use ) .