On period polynomials of degree $2^m$ and weight distributions of certain irreducible cyclic codes
Ioulia N. Baoulina

TL;DR
This paper explicitly computes reduced cyclotomic periods of order 2^m over finite fields with specific characteristics, uses these to factor period polynomials, and determines weight distributions of related irreducible cyclic codes.
Contribution
It provides explicit formulas for reduced cyclotomic periods and polynomials, and applies these to determine weight distributions of certain irreducible cyclic codes.
Findings
Explicit values of reduced cyclotomic periods for order 2^m
Factorizations of reduced period polynomials
Descriptions of weight distributions of specific cyclic codes
Abstract
We explicitly determine the values of reduced cyclotomic periods of order , , for finite fields of characteristic or . These evaluations are applied to obtain explicit factorizations of the corresponding reduced period polynomials. As another application, the weight distributions of certain irreducible cyclic codes are described.
| Value | Multiplicity |
|---|---|
| 1 |
| Value | Multiplicity |
|---|---|
| 1 |
| Value | Multiplicity |
|---|---|
| 1 |
| Value | Multiplicity |
|---|---|
| 1 |
| Value | Multiplicity |
|---|---|
| 1 | |
| 1 |
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
On period polynomials of degree and weight distributions of certain irreducible cyclic codes
Ioulia N. Baoulina
Department of Mathematics, Moscow State Pedagogical University,
Krasnoprudnaya str. 14, Moscow 107140, Russia
Abstract.
We explicitly determine the values of reduced cyclotomic periods of order , , for finite fields of characteristic . These evaluations are applied to obtain explicit factorizations of the corresponding reduced period polynomials. As another application, the weight distributions of certain irreducible cyclic codes are described.
Key words and phrases:
Keywords: Cyclotomic period; -nomial Gaussian period; period polynomial; reduced period polynomial; factorization; irreducible cyclic code; weight distribution.
1991 Mathematics Subject Classification:
Mathematics Subject Classification 2010: 11L05, 11T22, 11T24, 94B15
1. Introduction
Let be a finite field of characteristic with elements, , and let be a fixed generator of the cyclic group . By we denote the trace mapping, that is, for . Let and be positive integers such that . Denote by the subgroup of -th powers in . For any positive integer , write .
The cyclotomic (or -nomial Gaussian) periods of order for with respect to are defined by
[TABLE]
The reduced cyclotomic (or reduced -nomial Gaussian) periods of order for with respect to are defined by
[TABLE]
The period polynomial of degree for is the polynomial
[TABLE]
and the reduced period polynomial of degree for is
[TABLE]
The polynomials and have integer coefficients and are independent of the choice of generator . They are irreducible over the rationals when but not necessarily irreducible when . More precisely, and split over the rationals into factors of degree (not necessarily distinct), and each of these factors is irreducible or a power of an irreducible polynomial. Furthermore, the polynomials and are irreducible over the rationals if and only if . For proofs of these facts, see [9].
In the case , the period polynomials were determined explicitly by Gauss for and by many others for certain small values of . In the general case, Myerson [9] derived the explicit formulas for and when , and also found their factorizations into irreducible polynomials over the rationals. Gurak [7] obtained similar results for ; see also [6] for the case , . Hoshi [8] considered the case . Note that if is a power of modulo , then the period polynomials can also be easily obtained. Indeed, if and , with chosen minimal, then , and [9, Proposition 20] yields
[TABLE]
Baumert and Mykkeltveit [2] found the values of cyclotomic periods in the case when is a prime, and generates the quadratic residues modulo ; see also [9, Proposition 21].
It is seen immediately from the definitions that , and so it suffices to factorize only .
The aim of this paper is to find the values of reduced cyclotomic periods of order , , for finite fields of characteristic and obtain explicit factorizations of the corresponding reduced period polynomials. The traditional approach to cyclotomic periods is to express them in terms of Gauss sums and to apply known results about these sums. Instead, we observe that the values of reduced cyclotomic periods of order have already appeared implicitly in our recent paper [1], and so they can easily be deduced from our results on diagonal equations. The main result in Section 3 is Theorem 5, which gives the explicit factorization of in the case . Our main result of Section 4 is Theorem 8, in which we treat the case . In Section 5, we apply the results of previous sections to describe the weight distributions of certain irreducible cyclic codes. All the evaluations in Sections 3–5 are effected in terms of parameters occurring in quadratic partitions of some powers of .
2. Preliminary lemmas
We denote by the number of solutions to the equation in .
Lemma 1**.**
We have
[TABLE]
Proof.
See [3, Theorem 10.10.7 and Problem 22 in Exercises 12] (this lemma is equivalent to a special case of Proposition 1 in [11]). ∎
Lemma 2**.**
Assume that there exist complex numbers such that for ,
[TABLE]
Then
[TABLE]
that is, the sequence is just a permutation of the sequence.
Proof.
Let be elementary symmetric polynomials in the variables and for . Lemma 1 yields
[TABLE]
Using Newton’s formula
[TABLE]
for , we infer that
[TABLE]
Therefore, and are roots of the same monic polynomial of degree , as desired. ∎
Lemma 2 shows that the reduced cyclotomic periods of order and can be easily computed once we know a formula of the type (1). Let us present two examples.
Example 1*.*
Assume that , is a prime, , is a primitive root modulo and . Then
[TABLE]
(see [12, Theorem 5.1]), or, equivalently,
[TABLE]
Note that and for . Thus
[TABLE]
Example 2*.*
Assume that divides and . Rewriting the result of Wolfmann [12, Theorem 5.2] as
[TABLE]
and observing that is divisible by , we obtain
[TABLE]
3. Factorization of in the case
In this section, , , . Notice that (for a proof, see [4, Proposition 1]). Hence,
[TABLE]
Appealing to [9, Theorem 4], we conclude that in the case when , splits over the rationals into linear factors. If , then splits into irreducible polynomials of degrees at most 2.
For , define the integers and by
[TABLE]
It is well known [3, Lemma 3.0.1] that for each fixed , the conditions (2) determine and uniquely.
Lemma 3**.**
Let and . If , then
[TABLE]
If and , then
[TABLE]
If , then
[TABLE]
The integers and are uniquely determined by (2).
Proof.
See [1, Theorems 18 and 19]. ∎
Combining Lemmas 2 and 3, we deduce the following corollary.
Corollary 4**.**
Under the conditions of Lemma 3, the reduced cyclotomic periods of order are given by Tables 1–3.
We are now in a position to prove the main result of this section.
Theorem 5**.**
Let and . Then has a unique decomposition into irreducible polynomials over the rationals as follows:
- (a)
if , then
[TABLE]
[TABLE]
- (b)
if and , then
[TABLE]
- (c)
if , then
[TABLE]
The integers and are uniquely determined by (2), and
[TABLE]
Proof.
First assume that . In this case, all the cyclotomic periods are integers (see Table 1), and the result follows.
Next assume that and . In this case, has two pairs of complex conjugate roots, namely,
[TABLE]
and
[TABLE]
and the remaining roots are integers (see Table 2). Hence has the irreducible quadratic factors
[TABLE]
and
[TABLE]
(the last one occurs with multiplicity 2). The remaining factors are linear and occur with the multiplicities given in Table 2.
Finally, if , then has complex conjugate roots , , and the other roots are integers (see Table 3). Taking into account the multiplicities given in Table 3, we obtain the desired factorization. This completes the proof. ∎
Remark 1*.*
The result of Gurak [7, Proposition 3.3(iii)] can be reformulated in terms of and . Namely, has the following factorization into irreducible polynomials over the rationals:
[TABLE]
We see that Theorem 5 is not valid for .
4. Factorization of in the case
In this section, , , . As in the previous section, we have , and thus
[TABLE]
Using [9, Theorem 4], we see that splits over the rationals into linear factors if , splits into linear and quadratic irreducible factors if , and splits into linear, quadratic and biquadratic irreducible factors if .
For , define the integers and by
[TABLE]
If , we extend this notation to . It is well known [3, Lemma 3.0.1] that for each fixed , the conditions (3) determine and uniquely.
Lemma 6**.**
Let and . If , then
[TABLE]
If , then
[TABLE]
[TABLE]
The integers and are uniquely determined by (3).
Proof.
See [1, Theorems 22 and 23]. ∎
Combining Lemmas 2 and 6, we obtain the following corollary.
Corollary 7**.**
Under the conditions of Lemma 6, the reduced cyclotomic periods of order are given by Tables 4 and 5.
We are now ready to establish our second main result.
Theorem 8**.**
Let and . Then has a unique decomposition into irreducible polynomials over the rationals as follows:
- (a)
if , then
[TABLE]
- (b)
if , then
[TABLE]
- (c)
if , then
[TABLE]
The integers and are uniquely determined by (3), and
[TABLE]
Proof.
First suppose that . It follows from Table 4 that all the cyclotomic periods are integers in this case. This yields the desired factorization.
Next suppose that . In this case, we have two pairs of algebraic conjugates of degree 2 among the cyclotomic periods, namely,
[TABLE]
and
[TABLE]
and the remaining roots of are integers (see Table 4). Therefore has the irreducible quadratic factors
[TABLE]
and
[TABLE]
and the remaining factors are linear. Taking into account the multiplicities given in Table 4, we obtain the asserted result.
Finally, suppose that . In this case, there is a pair of algebraic conjugates of degree 2 among the cyclotomic periods, namely,
[TABLE]
This implies that has the irreducible quadratic factor
[TABLE]
occurring with multiplicity 2. Furthermore, the polynomials
[TABLE]
and
[TABLE]
belong to and are irreducible over the reals. Since and is a unique factorization domain, it follows that the product of the above polynomials, namely,
[TABLE]
belongs to and is irreducible over the rationals. We see from Table 5 that it occurs with multiplicity 1. The remaining factors are linear and occur with the multiplicities given in Table 5. This concludes the proof. ∎
Remark 2*.*
Myerson has shown [9, Theorem 17] that is irreducible if ,
[TABLE]
where in the latter case the quadratic polynomials are irreducible over the rationals. Furthermore, the result of Gurak [7, Proposition 3.3(ii)] can be reformulated in terms of , , and . Namely, has the following factorization into irreducible polynomials over the rationals:
[TABLE]
Thus part (a) of Theorem 8 remains valid for and . Moreover, for , part (b) of Theorem 8 is still valid (cf. Remark 1).
5. Weight distributions of certain irreducible cyclic codes
Let be a subfield of (i.e., divides ). A -dimensional linear subspace of is called a linear code over and is called the length of . The elements of are called codewords, and the number of nonzero components in is called the Hamming weight of . The polynomial is called the weight enumerator of and the vector is called the weight distribution of , where denotes the number of codewords with Hamming weight in .
A linear code is called cyclic if implies. Assume that . By identifying any vector with , any linear cyclic code of length over corresponds to an ideal of the principal ideal ring . If is an irreducible divisor of and corresponds to the ideal generated by , then is called an irreducible cyclic code.
Now let be a positive divisor of . As before, denotes a generator of the cyclic group . Put . If is the multiplicative order of modulo and is an irreducible cyclic code over , then is isomorphic to and can be represented as
[TABLE]
where denotes the trace mapping from to . It has been observed in [5] that the determination of the weight distribution of is equivalent to that of the cyclotomic periods of order for . More precisely, if for some , then
[TABLE]
where
[TABLE]
(see [5, Equation (12)]). Using this formula, the authors of [5] computed weight enumerators of when or 2 or 3 or 4; and when there exists an integer such that . They also noticed that the case can be treated in a similar manner, however, the weight formulas will be very complicated; see [10] for some results in this direction.
Assume now that or and with . We claim that is the multiplicative order of modulo . Indeed, it follows from [4, Proposition 1] that
[TABLE]
Therefore, 4 divides . This implies that and is odd. Since
[TABLE]
we have . Thus divides . Hence, if is the multiplicative order of modulo , then , which yields . Since must divide , we conclude that , and so is the multiplicative order of modulo . Combining the results given in Table 1 and Remark 1 with (5), we deduce the following theorem.
Theorem 9**.**
Let , be a positive divisor of with , . Then in (4) is an irreducible cyclic code over with the weight enumerator
[TABLE]
if , and with the weight enumerator
[TABLE]
if . The integers and are uniquely determined by (2).
In a similar manner, making use of Table 4 and equality (5), we obtain the following result.
Theorem 10**.**
Let , be a positive divisor of with , . Then in (4) is an irreducible cyclic code over with the weight enumerator
[TABLE]
[TABLE]
The integers and are uniquely determined by (3).
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] I. N. Baoulina, On a class of diagonal equations over finite fields, Finite Fields Appl. 40 (2016) 201–223.
- 2[2] L. D. Baumert, J. Mykkeltveit, Weight distributions of some irreducible cyclic codes, DSN Progr. Rep. 16 (1973) 128–131.
- 3[3] B. C. Berndt, R. J. Evans, K. S. Williams, Gauss and Jacobi Sums, Wiley-Interscience, New York, 1998.
- 4[4] R. F. Beyl, Cyclic subgroups of the prime residue group, Amer. Math. Monthly 84 (1977) 46–48.
- 5[5] C. Ding, J. Yang, Hamming weights in irreducible cyclic codes, Discrete Math. 313 (2013) 434–446.
- 6[6] S. Gurak, Period polynomials for 𝔽 p 2 subscript 𝔽 superscript 𝑝 2 \mathbb{F}_{p^{2}} of fixed small degree, in: Finite Fields and Applications, Springer Berlin Heidelberg, 2000, pp. 196–207.
- 7[7] S. J. Gurak, Period polynomials for 𝔽 q subscript 𝔽 𝑞 \mathbb{F}_{q} of fixed small degree, in: Number Theory, in: CRM Proc. and Lect. Notes, vol. 36, American Mathematical Society, 2004, pp. 127–145.
- 8[8] A. Hoshi, Explicit lifts of quintic Jacobi sums and period polynomials for 𝐅 q subscript 𝐅 𝑞 {\bf F}_{q} , Proc. Japan Acad., Ser. A 82 (2006) 87–92.
