Skip to main content
Erschienen in:

05.03.2021 | Original Paper

Gaussian sums, hyper Eisenstein sums and Jacobi sums over a local ring and their applications

verfasst von: Liqin Qian, Xiwang Cao

Erschienen in: Applicable Algebra in Engineering, Communication and Computing | Ausgabe 2/2023

Einloggen

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

search-config
loading …

Abstract

It is well known that any finite commutative ring is isomorphic to a direct product of local rings via the Chinese remainder theorem. Hence, there is a great significance to the study of character sums over local rings. Character sums over finite rings have applications that are analogous to the applications of character sums over finite fields. In particular, character sums over local rings have many applications in algebraic coding theory. In this paper, we firstly present an explicit description on additive characters and multiplicative characters over a certain local ring. Then we study Gaussian sums, hyper Eisenstein sums and Jacobi sums over a certain local ring and explore their properties. It is worth mentioning that we are the first to define Eisenstein sums and Jacobi sums over this local ring. Moreover, we present a connection between hyper Eisenstein sums over this local ring and Gaussian sums over finite fields, which allows us to give the absolute value of hyper Eisenstein sums over this local ring. As an application, several classes of codebooks with new parameters are presented.

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 "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!

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!

Literatur
1.
Zurück zum Zitat Berndt, B., Evans, R., Williams, K.: Gauss and Jacobi sums. Wiley, New York (1990)MATH Berndt, B., Evans, R., Williams, K.: Gauss and Jacobi sums. Wiley, New York (1990)MATH
2.
Zurück zum Zitat Cao, X., Chou, W., Zhang, X.: More constructions of near optimal codebooks associated with binary sequences. Adv. Math. Commun. 11(1), 187–202 (2017)MathSciNetMATHCrossRef Cao, X., Chou, W., Zhang, X.: More constructions of near optimal codebooks associated with binary sequences. Adv. Math. Commun. 11(1), 187–202 (2017)MathSciNetMATHCrossRef
3.
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
6.
Zurück zum Zitat Ding, C., Feng, T.: A generic construction of complex codebooks meeting the Welch bound. IEEE Trans. Inform. Theory 53(11), 4245–4250 (2007)MathSciNetMATHCrossRef Ding, C., Feng, T.: A generic construction of complex codebooks meeting the Welch bound. IEEE Trans. Inform. Theory 53(11), 4245–4250 (2007)MathSciNetMATHCrossRef
7.
Zurück zum Zitat Ding, C., Feng, T.: Codebooks from almost difference sets. Des. codes Crypt. 53(11), 4245–4250 (2007)MATH Ding, C., Feng, T.: Codebooks from almost difference sets. Des. codes Crypt. 53(11), 4245–4250 (2007)MATH
9.
Zurück zum Zitat Gao, J., Shen, L., Fu, F.: Generalized Quasi-Cyclic Codes Over \({\mathbb{F}}_q+u{\mathbb{F}}_q\). IEICE Trans. Fundam. Electron. Commun. Comput. Sci. E97.A(4) (2013) Gao, J., Shen, L., Fu, F.: Generalized Quasi-Cyclic Codes Over \({\mathbb{F}}_q+u{\mathbb{F}}_q\). IEICE Trans. Fundam. Electron. Commun. Comput. Sci. E97.A(4) (2013)
10.
Zurück zum Zitat Hellesth, T., Kumar, P., Shanbhag, A.: Exponential sums over Galois rings and their applications. In: Cohen, S., Niederreiter, H. (eds.) Finite Fields and Their Applications, pp. 109–128. Cambridge University Press, Cambridge (1996)CrossRef Hellesth, T., Kumar, P., Shanbhag, A.: Exponential sums over Galois rings and their applications. In: Cohen, S., Niederreiter, H. (eds.) Finite Fields and Their Applications, pp. 109–128. Cambridge University Press, Cambridge (1996)CrossRef
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
14.
15.
Zurück zum Zitat Kabatjanski, G., Levenstein, V.: Bounds for packing on a sphere and in space. Probl. Inf. Transmiss. 14, 1–17 (1978)MathSciNet Kabatjanski, G., Levenstein, V.: Bounds for packing on a sphere and in space. Probl. Inf. Transmiss. 14, 1–17 (1978)MathSciNet
16.
Zurück zum Zitat Kovacevic, J., Chebira, A.: An introduction to frames, found. Trends Signal Process. 2(1), 1–94 (2008)MATH Kovacevic, J., Chebira, A.: An introduction to frames, found. Trends Signal Process. 2(1), 1–94 (2008)MATH
17.
Zurück zum Zitat Kumar, P., Helleseth, T., Calderbank, A.: An upper bound for Weil exponential sums over Galois rings and applications. IEEE Trans. Inf. Theory 41(2), 456–468 (1995)MathSciNetMATHCrossRef Kumar, P., Helleseth, T., Calderbank, A.: An upper bound for Weil exponential sums over Galois rings and applications. IEEE Trans. Inf. Theory 41(2), 456–468 (1995)MathSciNetMATHCrossRef
18.
Zurück zum Zitat Kwon, T., Yoo, W.: Remarks on Gauss sums over Galois rings. Korean J. Math. 17, 43–52 (2009) Kwon, T., Yoo, W.: Remarks on Gauss sums over Galois rings. Korean J. Math. 17, 43–52 (2009)
19.
Zurück zum Zitat Levenshtein, V.: Bounds for packings of metric spaces and some of their applications, (in Russian). Probl. Cybern. 40, 43–110 (1983)MATH Levenshtein, V.: Bounds for packings of metric spaces and some of their applications, (in Russian). Probl. Cybern. 40, 43–110 (1983)MATH
21.
Zurück zum Zitat Luo, G., Cao, X.: Two constructions of asymptotically optimal codebooks via the hyper Eisenstein sum. IEEE Trans. Inf. Theory 64(10), 6498–6505 (2018)MathSciNetMATHCrossRef Luo, G., Cao, X.: Two constructions of asymptotically optimal codebooks via the hyper Eisenstein sum. IEEE Trans. Inf. Theory 64(10), 6498–6505 (2018)MathSciNetMATHCrossRef
22.
Zurück zum Zitat Luo, G., Cao, X.: New constructions of codebooks asymptotically achieving the Welch bound. In: 2018 IEEE International Symposium on Information Theory (ISIT)-Vail, CO, USA (2018.6.17–2018.6.22), pp. 2346-2350 Luo, G., Cao, X.: New constructions of codebooks asymptotically achieving the Welch bound. In: 2018 IEEE International Symposium on Information Theory (ISIT)-Vail, CO, USA (2018.6.17–2018.6.22), pp. 2346-2350
23.
Zurück zum Zitat Liu, H., Liao, Q.: Several classes of linear codes with a few weights from defining sets over \({\mathbb{F}}_p+u{\mathbb{F}}_p\). Des. Codes Cryptogr. 87, 15–29 (2019)MathSciNetCrossRef Liu, H., Liao, Q.: Several classes of linear codes with a few weights from defining sets over \({\mathbb{F}}_p+u{\mathbb{F}}_p\). Des. Codes Cryptogr. 87, 15–29 (2019)MathSciNetCrossRef
24.
Zurück zum Zitat Langevin, P., Solé, P.: Gauss sums over quasi-Frobenius rings. In: Jungnickel, D., Niederreiter, H. (eds.) Finite Fields and Their Applications, pp. 329–340. Springer, Berlin (2001)CrossRef Langevin, P., Solé, P.: Gauss sums over quasi-Frobenius rings. In: Jungnickel, D., Niederreiter, H. (eds.) Finite Fields and Their Applications, pp. 329–340. Springer, Berlin (2001)CrossRef
26.
Zurück zum Zitat Lidl, R., Niederreiter, H., Cohn, P.M.: Finite Fields. Cambridge University Press, Cambridge (1997) Lidl, R., Niederreiter, H., Cohn, P.M.: Finite Fields. Cambridge University Press, Cambridge (1997)
27.
Zurück zum Zitat Lu, W., Wu, X., Cao, X., Chen, M.: Six constructions of asymptotically optimal codebooks via the character sums. Des. Codes Cryptogr. 88, 1139–1158 (2020)MathSciNetMATHCrossRef Lu, W., Wu, X., Cao, X., Chen, M.: Six constructions of asymptotically optimal codebooks via the character sums. Des. Codes Cryptogr. 88, 1139–1158 (2020)MathSciNetMATHCrossRef
28.
Zurück zum Zitat Li, J., Zhu, S., Feng, K.: The Gauss sums and Jacobi sums over Galois ring \(GR(p^2, r)\). Sci. China Math. 56(7), 1457–1465 (2013)MathSciNetMATHCrossRef Li, J., Zhu, S., Feng, K.: The Gauss sums and Jacobi sums over Galois ring \(GR(p^2, r)\). Sci. China Math. 56(7), 1457–1465 (2013)MathSciNetMATHCrossRef
29.
Zurück zum Zitat Massey, J., Mittelholzer, T.: Welch Bound and Sequence Sets for Codedivision Multiple-Access Systems. Sequences II, pp. 63–78. Springer, New York (1999) Massey, J., Mittelholzer, T.: Welch Bound and Sequence Sets for Codedivision Multiple-Access Systems. Sequences II, pp. 63–78. Springer, New York (1999)
30.
Zurück zum Zitat Oh, Y., Oh, H.: Gauss sums over Galois rings of characteristic 4. Kangweon-Kyungki Math. J. 9, 1–7 (2011) Oh, Y., Oh, H.: Gauss sums over Galois rings of characteristic 4. Kangweon-Kyungki Math. J. 9, 1–7 (2011)
31.
Zurück zum Zitat Qian, L., Cao, X.: Character sums over a non-chain ring and their applications (submitted) Qian, L., Cao, X.: Character sums over a non-chain ring and their applications (submitted)
32.
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
33.
Zurück zum Zitat Shi, M., Alahmadi, A., Solé, P.: Codes and Rings: Theory and Practice. Academic Press, London (2017)MATH Shi, M., Alahmadi, A., Solé, P.: Codes and Rings: Theory and Practice. Academic Press, London (2017)MATH
34.
Zurück zum Zitat Shi, M., Wu, R., Qian, L., Sok, L., Solé, P.: New classes of \(p\)-ary few weight codes. Bull. Malays. Math. Sci. Soc. 42(4), 1393–1412 (2019)MathSciNetMATHCrossRef Shi, M., Wu, R., Qian, L., Sok, L., Solé, P.: New classes of \(p\)-ary few weight codes. Bull. Malays. Math. Sci. Soc. 42(4), 1393–1412 (2019)MathSciNetMATHCrossRef
35.
Zurück zum Zitat Shi, M., Wu, R., Liu, Y., Solé, P.: Two and three weight codes over \({\mathbb{F}}_p+u{\mathbb{F}}_p\). Cryptogr. Commun. 9(5), 637–646 (2017)MathSciNetCrossRef Shi, M., Wu, R., Liu, Y., Solé, P.: Two and three weight codes over \({\mathbb{F}}_p+u{\mathbb{F}}_p\). Cryptogr. Commun. 9(5), 637–646 (2017)MathSciNetCrossRef
36.
Zurück zum Zitat Shi, M., Qian, L., Solé, P.: New few weight codes from trace codes over a local Ring. Appl. Algebr. Eng. Comm. 29, 335–350 (2018)MATHCrossRef Shi, M., Qian, L., Solé, P.: New few weight codes from trace codes over a local Ring. Appl. Algebr. Eng. Comm. 29, 335–350 (2018)MATHCrossRef
37.
Zurück zum Zitat Sarwate, D.: Meeting the Welch Bound with Equality Sequences and Their Applications, pp. 79–102. Springer, London (1999)MATHCrossRef Sarwate, D.: Meeting the Welch Bound with Equality Sequences and Their Applications, pp. 79–102. Springer, London (1999)MATHCrossRef
38.
Zurück zum Zitat Strohmer, T., Heath, R.W.: Grassmannian frames with applications to coding and communication. Appl. Comput. Harmon. Anal. 14(3), 257–275 (2003)MathSciNetMATHCrossRef Strohmer, T., Heath, R.W.: Grassmannian frames with applications to coding and communication. Appl. Comput. Harmon. Anal. 14(3), 257–275 (2003)MathSciNetMATHCrossRef
39.
Zurück zum Zitat Tarokh, V., Kim, I.-M.: Existence and construction of noncoherent unitary space-time codes. IEEE Trans. Inf. Theory 48(12), 3112–3117 (2002)MathSciNetMATHCrossRef Tarokh, V., Kim, I.-M.: Existence and construction of noncoherent unitary space-time codes. IEEE Trans. Inf. Theory 48(12), 3112–3117 (2002)MathSciNetMATHCrossRef
41.
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
42.
Zurück zum Zitat Xiang, C., Ding, C., Mesnager, S.: Optimal codebooks from binary codes meeting the Levenshtein bound. IEEE Trans. Inf. Theory 61(12), 6526–6535 (2015)MathSciNetMATHCrossRef Xiang, C., Ding, C., Mesnager, S.: Optimal codebooks from binary codes meeting the Levenshtein bound. IEEE Trans. Inf. Theory 61(12), 6526–6535 (2015)MathSciNetMATHCrossRef
43.
Zurück zum Zitat Yamada, M.: Difference sets over Galois rings with odd extension degree and characteristic an even power of 2. Des. Code Cryptogr. 67, 37–57 (2013)MathSciNetMATHCrossRef Yamada, M.: Difference sets over Galois rings with odd extension degree and characteristic an even power of 2. Des. Code Cryptogr. 67, 37–57 (2013)MathSciNetMATHCrossRef
44.
Zurück zum Zitat Zhang, A., Feng, K.: Two classes of codebooks nearly meeting the Welch bound. IEEE Trans. Inf. Theory 58(4), 2507–2511 (2012)MathSciNetMATHCrossRef Zhang, A., Feng, K.: Two classes of codebooks nearly meeting the Welch bound. IEEE Trans. Inf. Theory 58(4), 2507–2511 (2012)MathSciNetMATHCrossRef
45.
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
46.
Metadaten
Titel
Gaussian sums, hyper Eisenstein sums and Jacobi sums over a local ring and their applications
verfasst von
Liqin Qian
Xiwang Cao
Publikationsdatum
05.03.2021
Verlag
Springer Berlin Heidelberg
Erschienen in
Applicable Algebra in Engineering, Communication and Computing / Ausgabe 2/2023
Print ISSN: 0938-1279
Elektronische ISSN: 1432-0622
DOI
https://doi.org/10.1007/s00200-021-00491-x