W. Alltop, Complex sequences with low periodic correlations, IEEE Transactions on Information Theory, vol.26, issue.3, pp.350-354, 1980.

J. Benedetto and M. Fickus, Finite normalized tight frames, Advances in Computational Mathematics, vol.18, issue.2-4, pp.357-385, 2003.

A. Calderbank, P. Cameron, W. Kantor, and J. Seidel, Z 4 -Kerdock codes, orthogonal spreads, and extremal Euclidean line-sets, Proc. London Math. Soc, vol.75, issue.3, pp.436-480, 1997.

P. Casazza and G. Kutyniok, Finite Frames: Theory and applications, 2012.

G. Chang, Complete diagonals of Latin squares, Canadian Journal of Mathematics, vol.22, issue.4, pp.477-481, 1979.

S. Datta and J. Oldroyd, Construction of k-angle tight frames, Numerical Functional Analysis and Optimization, vol.37, issue.8, pp.975-989, 2016.

P. Delsarte, J. Goethals, and J. Seidel, Bounds for systems of lines and Jacobi polynomials, Philips Res. Rep, vol.30, pp.91-105, 1975.

C. Ding and T. Feng, A generic construction of complex codebooks meeting the Welch bound, IEEE Transactions on Information Theory, vol.53, issue.11, pp.4245-4250, 2007.

C. Ding, S. Mesnager, C. Tang, and M. Xiong, Cyclic bent functions and their applications in codes, codebooks, designs, MUBs and sequences, 2018.

C. Ding and J. Yin, Signal sets from functions with optimal nonlinearity, IEEE Transactions on Communications, vol.55, issue.5, pp.936-940, 2007.

T. Durt, B. G. Englert, I. Bentsson, and K. Zyczkowski, On mutually unbiased bases, International Journal of Quantum Information, vol.8, pp.535-640, 2010.

M. Egan, C. Sung, and I. Collings, Structured and sparse limited feedback codebooks for multiuser MIMO, IEEE Transactions on Wireless Communications, vol.12, issue.8, pp.3710-3721, 2013.

M. Fickus, D. Mixon, and T. Tremain, Steiner equiangular tight frames, Linear Algebra Appl, vol.436, issue.5

J. Haas, N. Hammen, and D. Mixon, The levenshtein bound for packings in projective spaces, Wavelets and Sparsity XVII, 2017.

Z. Heng and Q. Yue, Optimal codebooks achieving the Levenshtein bound from generalized bent functions over Z 4, Cryptogr. Commun, vol.9, pp.41-53, 2017.

S. Hoggar, t-Designs in projective spaces, Europ. J. Combinatorics, vol.3, pp.233-254, 1982.

S. Hoggar, Parameters of t-designs in FP d?1, Europ. J. Combinatorics, vol.5, pp.29-36, 1984.

A. Klappenecker and M. Rotteler, Mutually unbiased bases are complex projective 2-designs, IEEE International Symposium on Information Theory, 2005.

V. Levenstein, Bounds for packing of metric spaces and some of their applications, Probl. Cybern, vol.40, pp.43-110, 1983.

J. Renes, R. Blume-kohout, A. Scott, and C. Caves, Symmetric informationally complete quantum measurements, Journal of Mathematical Physics, vol.45, issue.6, pp.2171-2180, 2004.

A. Roy and A. Scott, Weighted complex projective 2-designs from bases: optimal state determination by orthogonal measurements, Journal of Mathematical Physics, vol.48, issue.7, 2007.

T. Strohmer and R. Heath, Grassmannian frames with applications to coding and communication, Applied and Computational Harmonic Analysis, vol.14, issue.3, pp.257-275, 2003.

M. Thill and B. Hassibi, Group frames with few distinct inner products and low coherence, IEEE Transactions on Signal Processing, vol.63, pp.5222-5237, 2015.

R. Vale and S. Waldron, Tight frames and their symmetries, Constructive Approximation, vol.21, issue.1, pp.83-112, 2004.

S. Waldron, An Introduction to Finite Tight Frames, 2018.

L. Welch, Lower bounds on the maximum cross-correlation of signals, IEEE Transactions on Information Theory, vol.20, issue.3, pp.397-399, 1974.

W. Wootters and B. Fields, Optimal state-determination by mutually unbiased measurements, Annals of Physics, vol.191, issue.2, pp.363-381, 1989.

P. Xia, S. Zhou, and G. Giannakis, Achieving the Welch bound with difference sets, IEEE Transactions on Information Theory, vol.51, issue.5, pp.1900-1907, 2005.

C. Xiang, C. Ding, and S. Mesnager, Optimal codebooks from binary codes meeting the Levenshtein bound, IEEE Transactions on Information Theory, vol.61, issue.12, pp.6526-6535, 2015.

Z. Zhou, C. Ding, and N. Li, New families of codebooks achieving the Levenshtein bound, IEEE Transactions on Information Theory, vol.60, issue.11, pp.7382-7387, 2014.