Skip to main content
Erschienen in: Cryptography and Communications 6/2020

15.07.2020

Two constructions of asymptotically optimal codebooks via the trace functions

verfasst von: Xia Wu, Wei Lu, Xiwang Cao

Erschienen in: Cryptography and Communications | Ausgabe 6/2020

Einloggen

Aktivieren Sie unsere intelligente Suche um passende Fachinhalte oder Patente zu finden.

search-config
loading …

Abstract

In this paper, we present two new constructions of complex codebooks with multiplicative characters, additive characters and trace functions over finite fields, and determin the maximal cross-correlation amplitude of these codebooks. We prove that the codebooks we constructed are asymptotically optimal with respect to the Welch bound. Moreover, in the first construction, we generalize the result in Zhang and Feng (IEEE Trans. Inform. Theory 58(4), 2507–2511, 2012). In the second construction, we generalize the results in Hong et al. (IEEE Trans. Inf. Theory 60(6), 3698–3705, 2014), we can asymptotically achieve Welch bound for any odd prime p, we also derive the whole distribution of their inner products. The parameters of these codebooks are new.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Literatur
1.
Zurück zum Zitat Candes, E., Wakin, M.: An introduction to compressive sampling. IEEE Signal Process 25(2), 21–30 (2008)CrossRef Candes, E., Wakin, M.: An introduction to compressive sampling. IEEE Signal Process 25(2), 21–30 (2008)CrossRef
2.
Zurück zum Zitat Conway, J., Harding, R., Sloane, N.: Packing lines, planes, etc.: Packings in Grassmannian spaces. Exp. Math. 5(2), 139–159 (1996)MathSciNetMATHCrossRef Conway, J., Harding, R., Sloane, N.: Packing lines, planes, etc.: Packings in Grassmannian spaces. Exp. Math. 5(2), 139–159 (1996)MathSciNetMATHCrossRef
4.
Zurück zum Zitat Ding, C., Feng, T.: A generic construction of complex codebooks meeting the Welch bound. IEEE Trans. Inf. Theory 53(11), 4245–4250 (2007)MathSciNetMATHCrossRef Ding, C., Feng, T.: A generic construction of complex codebooks meeting the Welch bound. IEEE Trans. Inf. Theory 53(11), 4245–4250 (2007)MathSciNetMATHCrossRef
5.
Zurück zum Zitat Delsarte, P., Goethals, J., Seidel, J.: Spherical codes and designs. Geometriae Dedicate 67(3), 363–388 (1997)MathSciNetMATH Delsarte, P., Goethals, J., Seidel, J.: Spherical codes and designs. Geometriae Dedicate 67(3), 363–388 (1997)MathSciNetMATH
6.
7.
8.
Zurück zum Zitat Fickus, M., Mixon, D., Jasper, J.: Equiangular tight frames from hyperovals. IEEE Trans. Inf. Theory 62(9), 5225–5236 (2016)MathSciNetMATHCrossRef Fickus, M., Mixon, D., Jasper, J.: Equiangular tight frames from hyperovals. IEEE Trans. Inf. Theory 62(9), 5225–5236 (2016)MathSciNetMATHCrossRef
9.
Zurück zum Zitat Fickus, M., Jasper, J., Mixon, D., Peterson, J.: Tremain equiangular tight frames, arXiv:1602.03490v1 (2016) Fickus, M., Jasper, J., Mixon, D., Peterson, J.: Tremain equiangular tight frames, arXiv:1602.​03490v1 (2016)
10.
Zurück zum Zitat Helleseth, T., Kholosha, A.: Monomial and quadratic bent functions over the finite fields of odd characteristic. IEEE Trans. Inf. Theory 52(5), 2018–2032 (2006)MathSciNetMATHCrossRef Helleseth, T., Kholosha, A.: Monomial and quadratic bent functions over the finite fields of odd characteristic. IEEE Trans. Inf. Theory 52(5), 2018–2032 (2006)MathSciNetMATHCrossRef
11.
Zurück zum Zitat Hu, H., Wu, J.: New constructions of codebooks nearly meeting the Welch bound with equality. IEEE Trans. Inf. Theory 60(2), 1348–1355 (2014)MathSciNetMATHCrossRef Hu, H., Wu, J.: New constructions of codebooks nearly meeting the Welch bound with equality. IEEE Trans. Inf. Theory 60(2), 1348–1355 (2014)MathSciNetMATHCrossRef
12.
Zurück zum Zitat Hong, S., Park, H., Helleseth, T., Kim, Y.: Near optimal partial Hadamard codebook construction using binary sequences obtained from quadratic residue mapping. IEEE Trans. Inf. Theory 60(6), 3698–3705 (2014)MathSciNetMATHCrossRef Hong, S., Park, H., Helleseth, T., Kim, Y.: Near optimal partial Hadamard codebook construction using binary sequences obtained from quadratic residue mapping. IEEE Trans. Inf. Theory 60(6), 3698–3705 (2014)MathSciNetMATHCrossRef
13.
Zurück zum Zitat Heng, Z., Ding, C., Yue, Q.: New constructions of asymptotically optimal codebooks with multiplicative characters. IEEE Trans. Inf. Theory 63(10), 6179–6187 (2017)MathSciNetMATHCrossRef Heng, Z., Ding, C., Yue, Q.: New constructions of asymptotically optimal codebooks with multiplicative characters. IEEE Trans. Inf. Theory 63(10), 6179–6187 (2017)MathSciNetMATHCrossRef
15.
Zurück zum Zitat Kovacevic, J., Chebira, A.: An introduction to frames. Found. Trends Signal Process. 2(1), 1–94 (2008)MATHCrossRef Kovacevic, J., Chebira, A.: An introduction to frames. Found. Trends Signal Process. 2(1), 1–94 (2008)MATHCrossRef
16.
17.
Zurück zum Zitat Lu, W., Wu, X., Cao, X.W., Chen, M.: Six constructions of asymptotically optimal codebooks via the character sums. Des. Codes Cryptogr. 88(6), 1139–1158 (2020)MathSciNetMATHCrossRef Lu, W., Wu, X., Cao, X.W., Chen, M.: Six constructions of asymptotically optimal codebooks via the character sums. Des. Codes Cryptogr. 88(6), 1139–1158 (2020)MathSciNetMATHCrossRef
18.
Zurück zum Zitat Luo, G.J., Cao, X.W.: Two constructions of asymptotically optimal codebooks via the hyper Eisenstein sum. IEEE Trans. Inf. Theory 64(10), 6498–6505 (2018)MathSciNetMATHCrossRef Luo, G.J., Cao, X.W.: Two constructions of asymptotically optimal codebooks via the hyper Eisenstein sum. IEEE Trans. Inf. Theory 64(10), 6498–6505 (2018)MathSciNetMATHCrossRef
19.
Zurück zum Zitat Luo, G.J., Cao, X.W.: New constructions of codebooks asymptotically achieving the Welch bound. In: Proceedings IEEE Int. Symp. Inf. Theory, Vail, CO USA, pp 2346–2349 (2018) Luo, G.J., Cao, X.W.: New constructions of codebooks asymptotically achieving the Welch bound. In: Proceedings IEEE Int. Symp. Inf. Theory, Vail, CO USA, pp 2346–2349 (2018)
21.
Zurück zum Zitat Lidl, R., Niederreiter, H.: Finite fields. Cambridge University Press, Cambridge (1997)MATH Lidl, R., Niederreiter, H.: Finite fields. Cambridge University Press, Cambridge (1997)MATH
22.
Zurück zum Zitat Massey, J., Mittelholzer, T.: Welch’s bound and sequence sets for code-division multiple-access systems, Sequences II, pp 63–78. Springer, New York, (1999)MATH Massey, J., Mittelholzer, T.: Welch’s bound and sequence sets for code-division multiple-access systems, Sequences II, pp 63–78. Springer, New York, (1999)MATH
23.
Zurück zum Zitat Renes, J., Blume-Kohout, R., Scot, A., Caves, C.: Symmetric informationally complete quantum measurements. J. Math. Phys. 45(6), 2171–2180 (2004)MathSciNetMATHCrossRef Renes, J., Blume-Kohout, R., Scot, A., Caves, C.: Symmetric informationally complete quantum measurements. J. Math. Phys. 45(6), 2171–2180 (2004)MathSciNetMATHCrossRef
25.
Zurück zum Zitat Sarwate, D.: Meeting the Welch bound with equality, pp 63–79. Springe, New York (1999)MATH Sarwate, D.: Meeting the Welch bound with equality, pp 63–79. Springe, New York (1999)MATH
26.
Zurück zum Zitat Strohmer, T., Heath, R.: Grassmannian frames with applications to coding and communication. Appl. Comput. Harmon. Anal. 14(3), 257–275 (2003)MathSciNetMATHCrossRef Strohmer, T., Heath, R.: Grassmannian frames with applications to coding and communication. Appl. Comput. Harmon. Anal. 14(3), 257–275 (2003)MathSciNetMATHCrossRef
27.
Zurück zum Zitat Welch, L.: Lower bounds on the maximum cross correlation of signals. IEEE Trans. Inform. Theory 20(3), 397–399 (1974)MATHCrossRef Welch, L.: Lower bounds on the maximum cross correlation of signals. IEEE Trans. Inform. Theory 20(3), 397–399 (1974)MATHCrossRef
28.
Zurück zum Zitat Xia, P., Zhou, S., Giannakis, G.: Achieving the Welch bound with difference sets. IEEE Trans. Inform. Theory 51(5), 1900–1907 (2005)MathSciNetMATHCrossRef Xia, P., Zhou, S., Giannakis, G.: Achieving the Welch bound with difference sets. IEEE Trans. Inform. Theory 51(5), 1900–1907 (2005)MathSciNetMATHCrossRef
29.
30.
Zurück zum Zitat Zhang, A., Feng, K.: Two classes of codebooks nearly meeting the Welch bound. IEEE Trans. Inform. Theory 58(4), 2507–2511 (2012)MathSciNetMATHCrossRef Zhang, A., Feng, K.: Two classes of codebooks nearly meeting the Welch bound. IEEE Trans. Inform. Theory 58(4), 2507–2511 (2012)MathSciNetMATHCrossRef
31.
Zurück zum Zitat Zhang, A., Feng, K.: Construction of cyclotomic codebooks nearly meeting the Welch bound. Des. Codes Cryptogr. 63(2), 209–224 (2013)MathSciNetMATHCrossRef Zhang, A., Feng, K.: Construction of cyclotomic codebooks nearly meeting the Welch bound. Des. Codes Cryptogr. 63(2), 209–224 (2013)MathSciNetMATHCrossRef
32.
Metadaten
Titel
Two constructions of asymptotically optimal codebooks via the trace functions
verfasst von
Xia Wu
Wei Lu
Xiwang Cao
Publikationsdatum
15.07.2020
Verlag
Springer US
Erschienen in
Cryptography and Communications / Ausgabe 6/2020
Print ISSN: 1936-2447
Elektronische ISSN: 1936-2455
DOI
https://doi.org/10.1007/s12095-020-00448-w

Weitere Artikel der Ausgabe 6/2020

Cryptography and Communications 6/2020 Zur Ausgabe