×

Three-valued Gauss periods, circulant weighing matrices and association schemes. (English) Zbl 1339.05433

Summary: Gauss periods taking exactly two values are closely related to two-weight irreducible cyclic codes and strongly regular Cayley graphs. They have been extensively studied in the work of B. Schmidt and C. White [Finite Fields Appl. 8, No. 1, 1–17 (2002; Zbl 1023.94016)] and others. In this paper, we consider the question of when Gauss periods take exactly three rational values. We obtain numerical necessary conditions for Gauss periods to take exactly three rational values. We show that in certain cases, the necessary conditions obtained are also sufficient. We give numerous examples where the Gauss periods take exactly three values. Furthermore, we discuss connections between three-valued Gauss periods and combinatorial structures such as circulant weighing matrices and three-class association schemes.

MSC:

05E30 Association schemes, strongly regular graphs
05C25 Graphs and abstract algebra (groups, rings, fields, etc.)
94B15 Cyclic codes

Citations:

Zbl 1023.94016

References:

[1] Baumert, L.D., McEliece, R.J.: Weights of irreducible cyclic codes. Inf. Control 20, 158-175 (1972) · Zbl 0239.94007 · doi:10.1016/S0019-9958(72)90354-3
[2] Berndt, B., Evans, R., Williams, K.S.: Gauss and Jacobi sums. Wiley, New York (1997) · Zbl 0906.11001
[3] Brouwer, A.E., Cohen, A.M., Neumaier, A.: Distance-Regular Graphs, Ergebnisse der Mathematik und ihrer Grenzgebiete (3) [Results in Mathematics and Related Areas (3)], vol. 18. Springer, Berlin (1989) · Zbl 0747.05073
[4] Evans, R., Hollmann, H.D.L., Krattenthaler, C., Xiang, Q.: Gauss sums, Jacobi sums, and \[p\] p-ranks of cyclic difference sets. J. Comb. Theory (A) 87, 74-119 (1999) · Zbl 0943.05021 · doi:10.1006/jcta.1998.2950
[5] Feng, T.: On cyclic codes of length \[2^{2^r-1}22\] r-1 with two zeros whose dual codes have three weights. Des. Code Cryptogr. 62, 253-258 (2012) · Zbl 1282.94096 · doi:10.1007/s10623-011-9514-0
[6] Feng, T., Xiang, Q.: Strongly regular graphs from union of cyclotomic classes. J. Comb. Theory (B) 102, 982-995 (2012) · Zbl 1246.05177 · doi:10.1016/j.jctb.2011.10.006
[7] Feng, T., Xiang, Q.: Cyclotomic constructions of skew Hadamard difference sets. J. Comb. Theory (A) 119, 245-256 (2012) · Zbl 1232.05031 · doi:10.1016/j.jcta.2011.08.007
[8] Feng, T., Momihara, K.: Three-class association schemes from cyclotomy. J. Comb. Theory (A) 120, 1202-1215 (2013) · Zbl 1278.05247 · doi:10.1016/j.jcta.2013.03.002
[9] Feng, T., Momihara, K., Xiang, Q.: Constructions of strongly regular Cayley graphs and skew Hadamard difference sets from cyclotomic classes. Combinatorica 35, 413-434 (2015) · Zbl 1374.05112 · doi:10.1007/s00493-014-2895-8
[10] Jungnickel, D., Vedder, K.: On the geometry of planar difference sets. Eur. J. Comb. 5, 143-148 (1984) · Zbl 0543.05010 · doi:10.1016/S0195-6698(84)80028-1
[11] McEliece, R.J.: Irreducible cyclic codes and Gauss sums. Combinatorics (Proc. NATO Advanced Study Inst., Breukelen, 1974), Part 1: theory of designs, finite geometry and coding theory. In: Math. Centre Tracts, vol. 55. Math. Centrum, Amsterdam, pp.179-196 (1974) · Zbl 0309.94022
[12] Pott, A.: Finite Geometry and Character Theory. Springer, Berlin (1995) · Zbl 0818.05001
[13] Schmidt, B., White, C.: All two-weight irreducible cyclic codes? Finite Fields Appl. 8, 1-17 (2002) · Zbl 1023.94016 · doi:10.1006/ffta.2000.0293
[14] Wallis, J.S., Whiteman, A.L.: Some results on weighing matrices. Bull. Aust. Math. Soc. 12, 433-447 (1975) · Zbl 0297.05023 · doi:10.1017/S0004972700024096
[15] Yang, J., Xia, L.: Complete solving of explicit evaluation of Gauss sums in the index 2 case. Sci. China Ser. A 53, 2525-2542 (2010) · Zbl 1267.11089 · doi:10.1007/s11425-010-3155-z
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.