Optimal codebooks achieving the Levenshtein bound from generalized bent functions over Z4\mathbb {Z}_{4}Z4​ (original) (raw)

References

  1. Brown, E.H.: Generalizations of the Kervaire invariant. Annals. Math. 95(2), 368–383 (1972)
    Article MathSciNet MATH Google Scholar
  2. Christensen, O.: An Introduction to Frames and Risez Bases. Birkhäuser, MA, USA (2003)
    Book MATH Google Scholar
  3. Calderbank A.R., Cameron, P.J., Kantor, W.M., Seidel, J.J.: \(\mathbb {Z}_{4}\)-kerdock codes, orthogonal spreads, and extremal Euclidean line-sets. Proc. London Math. Soc. 75(3), 436–480 (1997)
  4. Conway, J.H., Harding, R.H., Sloane, N.J.A.: Packing lines, planes, etc.: Packings in grassmannian spaces. Exp. Math. 5(2), 139–159 (1996)
    Article MathSciNet MATH Google Scholar
  5. Carlet, C., Mesnager, S.: Four decades of research on bent functions. Des. Codes Crypt. 78, 5–50 (2016)
    Article MathSciNet MATH Google Scholar
  6. Ding, C.: Complex codebooks from combinatorial designs. IEEE Trans. Inf. Theory 52(9), 4229–4235 (2006)
    Article MathSciNet MATH Google Scholar
  7. Ding, C., Feng, T.: Codebooks from almost difference sets. Des. codes Crypt. 53(11), 4245–4250 (2007)
    MathSciNet MATH Google Scholar
  8. Ding, C., Feng, T.: A generic construction of complex codebooks meeting the Welch bound. Des. Codes Crypt. 46(1), 113–126 (2008)
    Article MathSciNet MATH Google Scholar
  9. Ding, C., Yin, J.: Singal sets from functions with optimal nonlinearity. IEEE Trans. Commun. 55(5), 936–940 (2007)
    Article Google Scholar
  10. Heng, Z., Yue, Q.: Generalized Gray map and a class of _p_-ary nonlinear codes. Finite Fields Appl. 36, 81–97 (2015)
    Article MathSciNet MATH Google Scholar
  11. Hu, L., Yue, Q.: Gauss periods and codebooks from generalized cyclotomic sets of order four. Des. Codes Crypt. 69(2), 233–246 (2013)
    Article MathSciNet MATH Google Scholar
  12. Helleseth, T., Kumar, P.V.: Codes with the same weight distribution as the Goethals codes and the Delsarte-Goethals codes. Des. Codes Crypt. 9(3), 257–266 (1996)
    MathSciNet MATH Google Scholar
  13. Hammons, Jr. A.R., Kumar, P.V., Calderbank, A.R., Sloane, N.J.A., Solé, P.: The \(\mathbb {Z}_{4}\)-linearity of Kerdock, Preparata, Goethals, and related codes. IEEE Trans. Inf. Theory 40(2), 301–319 (1994)
  14. Jiang, W., Hu, L., Tang, X., Zeng, X.: New optimal quadriphase sequences with larger linear span. IEEE Trans. Inf. Theory 55(1), 458–470 (2009)
    Article MathSciNet Google Scholar
  15. Kabatyanskii, G.A., Levenshtein, V.I.: Bounds for packing on a sphere and in space. Probl. Inf. Transmission 14, 1–17 (1978)
    MATH Google Scholar
  16. Kim, S.H., No, J.S.: New families of binary sequences with low correlation. IEEE Trans. Inf. Theory 149(111), 3059–3065 (2003)
    MathSciNet MATH Google Scholar
  17. Li, C., Yue, Q., Huang, Y.: Two families of nearly optimal codebooks. Des. Codes Crypt. 75(1), 43–57 (2015)
    Article MathSciNet MATH Google Scholar
  18. Li, N., Tang, X., Helleseth, T.: New constructions of quadratic bent functions in pilynomial form. IEEE Trans. Inf. Theory 60(9), 5760–5767 (2014)
    Article MathSciNet Google Scholar
  19. Levenshtein, V.I.: Bounds for packing of metric spaces and some of their applications. Probl. Cybern. 40, 43–110 (1983)
    MathSciNet MATH Google Scholar
  20. Massey, J.L., Mittelholzer, T.: Welch’s bound and sequence set for code-division muitiple-access systems, pp 63–78. Springer-verlag, NY, USA (1993)
    MATH Google Scholar
  21. Mesnager, S.: Bent functions: Fundamentals and Results. Springer-Verlag, Heidelberg, Germany (2015)
    MATH Google Scholar
  22. Sarwate, D.: Meeting the Welch bound with equality, pp 63–79. Proceedings of SETA’98, Springer-Verlag, Berlin, Heidelberg (1999)
    MATH Google Scholar
  23. Strohmer, Jr. T., Heath, R.W.: Grassmannian frames with applications to coding and communications. Appl. Comput. Harmonic Anal. 14, 257–275 (2003)
    Article MathSciNet MATH Google Scholar
  24. Schmidt, K.: \(\mathbb {Z}_{4}\)-valued quadratic forms and quaternary sequence families. IEEE Trans. Inf. Theory 55(12), 5803–5810 (2009)
    Article MathSciNet Google Scholar
  25. Solé, P., Tokareva, N.: Connections between quaternary and binary bent functions. [Online]. Available: http://www.eprint.iacr.org/2009/544 (2009)
  26. Welch, L.: Lower bounds on the maximum cross correlation of signal. IEEE Trans. Inf. Theory IT-20, 397–399 (1974)
  27. Wooters, W., Fields, B.: Optimal state-determination by mutually unbiased measurements. Ann. Phys. 191(2), 363–381 (1989)
    Article MathSciNet Google Scholar
  28. Xia, P., Zhou, S., Giannakis, G.B.: Achieving the Welch bound with difference sets. IEEE Trans. Inf. Theory 51(5), 1900–1907 (2005)
    Article MathSciNet MATH Google Scholar
  29. Xiang, C., Ding, C., Mesnager, S.: Optimal codebooks from binary codebooks meeting the Levenshtein bound. IEEE Trans. Inf. Theory 61(12), 6526–6535 (2015)
    Article MathSciNet Google Scholar
  30. Zhang, A., Feng, K.: Construction of cyclotomic codebooks nearly meeting the Welch bound. Des. Codes Crypt. 63(2), 209–224 (2012)
    Article MathSciNet MATH Google Scholar
  31. Zhang, A., Feng, K.: Two classes of codebooks nearly meeting the Welch bound. IEEE Trans. Inf. Theory 58(4), 2507–2511 (2009)
    Article MathSciNet Google Scholar
  32. Zhou, Z., Ding, C., Li, N.: New families of codebooks achieving the Levenshtein bound. IEEE Trans. Inf. Theory 60(11), 7382–7387 (2014)
    Article MathSciNet Google Scholar

Download references