Skip to main content
Log in

Gauss periods and codebooks from generalized cyclotomic sets of order four

  • Published:
Designs, Codes and Cryptography Aims and scope Submit manuscript

Abstract

Let p, q be distinct primes with gcd(p − 1, q − 1) = 4. Let D 0, D 1, D 2, D 3 be Whiteman’s generalized cyclotomic classes, satisfying the multiplicative group \({{\mathbb Z}^*_{pq}=D_0\cup D_1\cup D_2\cup D_3}\) . In this paper, we give formulas of Gauss periods: \({\sum_{i\in D_0\cup D_2}\zeta^i}\) and \({\sum_{i\in D_0}\zeta^i}\) , where \({\zeta}\) is a pqth primitive root of unity. As an application, we get the maximum cross-correlation amplitudes of three codebooks from generalized cyclotomic sets of order four and supply conditions on p and q such that they nearly meet the Welch bound.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Bai E., Liu X.: Generalized cyclotomic sequences of order four over \({{\mathbb Z}_{pq}}\) and their autocorrelation values. Chin. J. Eng. Math. 25, 894–900 (2008)

    MathSciNet  MATH  Google Scholar 

  2. Ding C.: Autocorrelation values of generalized cyclotomic sequences of order two. IEEE Trans. Inf. Theory 44(4), 1698–1702 (1998)

    Google Scholar 

  3. Ding C.: Complex codebooks from combinatorial designs. IEEE Trans. Inf. Theory 52(9), 4229–4235 (2006)

    Article  MATH  Google Scholar 

  4. Ding C., Feng T.: A generic construction of complex codebooks meeting the Welch bound. IEEE Trans. Inf. Theory 53(11), 4245–4250 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  5. Ding C., Feng T.: Codebooks from almost difference sets. Des. Codes Cryptogr. 46(1), 113–126 (2008)

    Article  MathSciNet  Google Scholar 

  6. Liu F., Peng D., Zhou Z., Tang X.: Construction of frequency hopping sequence set based upon generalized cyclotomy. ArXiv: 1009.3602v1.

  7. Massey J.L., Mittelholzer T.: Welch’s bound and sequence sets for code-division multiple-access systems. In: Sequences II: Methods in Communication, Security and Computer Science, pp. 63–78. Springer, Heidelberg (1993).

  8. Sarwate D.: Meeting the Welch bound with equality. In: Sequences and their Applications, Proceedings of SETA’98, pp. 79–102. Springer, London (1999).

  9. Welch L.: Lower bounds on the maximum cross correlation of signals. IEEE Trans. Inf. Theory 20(3), 397–399 (1974)

    Article  MathSciNet  MATH  Google Scholar 

  10. Whiteman A.L.: A family of difference sets. Illinois J. Math. 6(1), 107–121 (1962)

    MathSciNet  MATH  Google Scholar 

  11. 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 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Qin Yue.

Additional information

Communicated by K. T. Arasu.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Hu, L., Yue, Q. Gauss periods and codebooks from generalized cyclotomic sets of order four. Des. Codes Cryptogr. 69, 233–246 (2013). https://doi.org/10.1007/s10623-012-9648-8

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10623-012-9648-8

Keywords

Mathematics Subject Classification

Navigation