Abstract
In this paper, we give the Jacobi polynomials for first-order generalized Reed–Muller codes. We show as a corollary the nonexistence of combinatorial 3-designs in these codes.
Similar content being viewed by others
1 Introduction
There is growing interest in the designs derived from codes within the fields of coding theory and design theory. In [3, 9], a criterion was provided for determining whether a shell of a code constitutes a t-design, using Jacobi polynomials (see Proposition 2.2, the definition of the Jacobi polynomials will be given in Sect. 2.2). Using this criterion, in [3, 5], they presented t-designs derived from Type II, III, and IVcodes with short lengths. Additionaly, Miezaki and Munemasa [6] provided Jacobi polynomials for the first-order Reed–Muller codes. As a corollary, they showed the nonexistence of combinatorial 4-designs in these codes. The purpose of the present paper is to give a generalization of Miezaki and Munemasa’s results.
Let m be a positive integer and q be a prime power, and set \(V = \mathbb {F}_q^m\). The first-order generalized Reed–Muller (GRM) code \(RM_q(1, m)\) is defined as the subspace of \(\mathbb {F}_q^V\) consisting of affine linear functions:
where \(V^* = \textrm{Hom}(V, \mathbb {F}_q)\). We remark that the weight enumerator of \(RM_q(1, m)\) is
Let \(C = RM_q(1, m)\) and \(C_\ell := \{ c \in C \mid \textrm{wt}(c) = \ell \}\). In this paper, we call \(C_\ell \) a shell of the code C whenever it is non-empty. We show shells of C are combinatorial 2-designs but are not combinatorial 3-designs by using Jacobi polynomials. More precisely, the set \(\mathcal {B}(C_\ell ):= \{ \textrm{supp}(x) \mid x \in C_\ell \}\) forms the set of blocks of a combinatorial 2-design but does not form a 3-design. Herein, we always assume that a combinatorial t-design allows the existence of repeated blocks, and we exclude the trivial design \(\mathcal {D} = (\Omega , \mathcal {B})\) where \(\Omega = \{1,\ldots ,n\}\) and \(\mathcal {B} = \{\Omega ,\dots ,\Omega \}\).
Remark
In [7], Miezaki and Nakasora provided the first non-trivial examples of a code whose shells are t-designs for all weights and whose shells are \(t'\)-designs for some weights with some \(t' > t\) (see also [1, 8]). Therefore, it is important to determine the value t such that all shells of a code are t-designs, and no shell is a \(t+1\)-design, if such a t exists.
First, we provide Jacobi polynomials for C with T, where \(|T| = 2\).
Theorem 1.1
Let \(C=RM_q(1, m)\) and \(T = \{0, u\} \in \left( {\begin{array}{c}V\\ 2\end{array}}\right) \). Then,
Using this theorem, we show that the shells of \(RM_q(1, m)\) and \(RM_q(1, m)^\perp \) are 2-designs.
Corollary 1.2
Let \(C=RM_q(1,m)\). Then for any \(\ell \in \mathbb {N}\), \(C_\ell \) is a combinatorial 2-design. Similarly, \((C^\perp )_\ell \) is a combinatorial 2-design.
Second, we provide Jacobi polnomials for C with T, where \(|T| = 3\).
Theorem 1.3
Let \(C=RM_q(1, m)\), \(T=\{0, u_1, u_2\} \in \left( {\begin{array}{c}V\\ 3\end{array}}\right) \), and \(A = {}^t[u_1\ u_2]\).
-
1.
If \(\textrm{rank}\, A = 2\), then
$$\begin{aligned} J_{C, T}(w, z, x, y) =&w^3x^{q^m - 3} + (q^{m - 2} - 1) w^3x^{q^{m - 1} - 3}y^{(q - 1)q^{m - 1}} \\&+ 3q^{m - 2}(q - 1) w^2zx^{q^{m - 1} - 2}y^{(q - 1)q^{m - 1} - 1} \\&+ 3q^{m - 2}(q - 1)^2 wz^2x^{q^{m - 1} - 1}y^{(q - 1)q^{m - 1} - 2} \\&+ (q - 1)(q^m - 2q^{m - 1} + q^{m - 2} - 1) z^3x^{q^{m - 1}}y^{(q - 1)q^{m - 1} - 3} \\&+ (q - 1)z^3y^{q^m - 3}. \end{aligned}$$ -
2.
If \(\textrm{rank}\, A = 1\), then
$$\begin{aligned} J_{C, T}(w, z, x, y) =&w^3x^{q^m - 3} + (q^{m - 1} - 1) w^3x^{q^{m - 1} - 3}y^{(q - 1)q^{m - 1}} \\&+ 3q^{m - 1}(q - 1) wz^2x^{q^{m - 1} - 1}y^{(q - 1)q^{m - 1} - 2} \\&+ (q - 1)(q^m - 2q^{m - 1} - 1) z^3x^{q^{m - 1}}y^{(q - 1)q^{m - 1} - 3} \\&+ (q - 1)z^3y^{q^m - 3}. \end{aligned}$$
We show, as a corollary, the nonexistence of combinatorial 3-designs in these codes.
Corollary 1.4
Let \(C=RM_q(1,m)\). If \(q \ge 3\) and \(m \ge 2\), then for any \(\ell \in \mathbb {N}\), \(C_\ell \) is not a combinatorial 3-design.
Using Theorem 1.3, we show that \(C_\ell \) is a 3-\((v, k, (\lambda _1, \lambda _2))\)-design (see Sect. 2.1).
Corollary 1.5
Let \(C = RM_q(1, m)\) and \(\ell = (q - 1)q^{m-1}\). Then, \(C_\ell \) is a combinatorial 3-\((v, k, (\lambda _1, \lambda _2))\)-design, where
Third, we provide Jacobi polnomials for C with T, where \(|T| = 4\).
Theorem 1.6
Let \(C=RM_q(1, m)\), \(T=\{0, u_1, u_2, u_3\} \in \left( {\begin{array}{c}V\\ 4\end{array}}\right) \), and \(A = {}^t[u_1\ u_2\ u_3]\).
-
1.
If \(\textrm{rank}\, A = 3\) then,
$$\begin{aligned} J_{C, T}(w, z, x, y) =&w^4 x^{q^m - 4} + (q^{m-3} - 1)w^4x^{q^{m - 1} - 4}y^{(q - 1)q^{m - 1}} \\&+ 4q^{m - 3}(q - 1)w^3zx^{q^{m - 1} - 3}y^{(q - 1)q^{m - 1} - 1} \\&+ 6(q - 1)^2q^{m - 3}w^2z^2x^{q^{m - 1} - 2}y^{(q - 1)q^{m - 1} - 2} \\&+ 4q^{m - 3}(q - 1)^3wz^3x^{q^{m - 1} - 1}y^{(q - 1)q^{m - 1} - 3} \\&+ (q - 1)(q^m - 3q^{m - 1} {+} 3q^{m - 2} - q^{m - 3} - 1)z^4x^{q^{m - 1}}y^{(q - 1)q^{m - 1} - 4} \\&+ (q - 1)z^4y^{q^m - 4}. \end{aligned}$$ -
2.
If \(\textrm{rank}\, A = 2\) then,
$$\begin{aligned} J_{C, T}(w, z, x, y) =&w^4 x^{q^m - 4} + (q^{m - 2} - 1)w^4x^{q^{m - 1} - 4}y^{(q - 1)q^{m - 1}} \\&+ q^{m - 2}(q - 1) w^3zx^{q^{m - 1} - 3}y^{(q - 1)q^{m - 1} - 1} \\&+ 3q^{m - 2} (q - 1) w^2z^2x^{q^{m - 1} - 2}y^{(q - 1)q^{m - 1} - 2} \\&+ q^{m - 2}(q - 1)(4q - 5) wz^3x^{q^{m - 1} - 1}y^{(q - 1)q^{m - 1} - 3} \\&+ (q - 1)(q^m - 3q^{m - 1} + 2q^{m - 2} - 1) z^4x^{q^{m - 1}}y^{(q - 1)q^{m - 1} - 4} \\&+ (q - 1)z^4y^{q^m - 4} \end{aligned}$$or
$$\begin{aligned} J_{C, T}(w, z, x, y) =&w^4 x^{q^m - 4} + (q^{m - 2} - 1)w^4x^{q^{m - 1} - 4}y^{(q - 1)q^{m - 1}} \\&+ 6q^{m - 2}(q - 1)w^2z^2x^{q^{m - 1} - 2}y^{(q - 1)q^{m - 1} - 2} \\&+ q^{m - 2}(q - 1)(4q - 8) wz^3x^{q^{m - 1} - 1}y^{(q - 1)q^{m - 1} - 3} \\&+ (q - 1)(q^m - 3q^{m - 1} + 3q^{m - 2} - 1) z^4x^{q^{m - 1}}y^{(q - 1)q^{m - 1} - 4} \\&+ (q - 1)z^4y^{q^m - 4}. \end{aligned}$$ -
3.
If \(\textrm{rank}\, A = 1\) then,
$$\begin{aligned} J_{C, T}(w, z, x, y) =&w^4 x^{q^m - 4} + (q^{m - 1} - 1)w^4x^{q^{m - 1} - 4}y^{(q - 1)q^{m - 1}} \\&+ 4q^{m - 1}(q - 1)wz^3x^{q^{m - 1} - 1}y^{(q - 1)q^{m - 1} - 3} \\&+ (q - 1)(q^m - 3q^{m - 1} - 1) z^4x^{q^{m - 1}}y^{(q - 1)q^{m - 1} - 4} \\&+ (q - 1)z^4y^{q^m - 4}. \end{aligned}$$
By this theorem, we show that \(C_\ell \) is a combinatorial 4-\((v,k,(\lambda _1,\lambda _2,\lambda _3,\lambda _4))\)-design.
Corollary 1.7
Let \(C {=} RM_q(1, m)\) and \(\ell {=} (q-1)q^{m-1}\). Then \(C_\ell \) is a 4-\((v, k, (\lambda _1,\lambda _2,\lambda _3,\lambda _4))\)-design, where
This paper is organized as follows. In Sect. 2, we define and give some basic properties of codes, combinatorial t-designs, and Jacobi polynomials used in this paper. In Sects. 3, 4, and 5, we show Theorems 1.1, 1.3, and 1.6, respectively.
All computer calculations reported in this paper were carried out using Magma [4] and Mathematica [10].
2 Preliminaries
In this section, we give definitions and some properties of codes, combinatorial designs, and Jacobi polynomials. We mainly refer to [6] and [5].
2.1 Codes and combinatorial t-designs
Let q be a prime power. A q-ary linear code C of length n is a linear subspace of \(\mathbb {F}_q^n\). The dual code of C is the set of vectors which are orthogonal to any codewords in C: \(C^{\perp }:= \{x \in \mathbb {F}_q^n \mid x \cdot c = 0\ \mathrm {for\ all\ } c \in C\}\). For \(c \in \mathbb {F}_q^n\), the weight \(\textrm{wt}(c)\) is the number of its nonzero components. The shell of a weight-\(\ell \) is the set of codewords whose weight is \(\ell \): \(C_\ell := \{ c \in C \mid \textrm{wt}(c) = \ell \}\).
A combinatorial t-design is a pair \(\mathcal {D} = (\Omega , \mathcal {B})\), where \(\Omega \) is a set of points of cardinality v, and \(\mathcal {B}\) is a collection of k-element subsets of \(\Omega \) called blocks, with the property that any t-element subset of \(\Omega \) is contained in precisely \(\lambda \) blocks. Recall [3] for the definitions of various types of designs. A pair \(\mathcal {D} = (\Omega , \mathcal {B})\) is a combinatorial design with parameters t-\((v, k, (\lambda _1,\ldots ,\lambda _N))\) if \(\mathcal {B}\) is a collection of k-element subsets of \(\Omega \) called blocks and every t-element subset of \(\Omega \) is contained in \(\lambda _i\) blocks. Note that for \(N=1\), the design coincides exactly with a t-design.
The support of a vector \(x:= (x_1,\ldots ,x_n)\), \(x_i \in \mathbb {F}_q\), is the set of indices of its nonzero coordinates: \(\textrm{supp}(x) = \{ i \mid x_i \ne 0\}\). Let \(\Omega := \{1,\dots ,n\}\) and \(\mathcal {B}(C_\ell ):= \{\textrm{supp}(x)\mid x \in C_\ell \}\). Then for a code C of length n, we say that the shell \(C_\ell \) is a combinatorial t-design if \((\Omega , \mathcal {B}(C_\ell ))\) is a combinatorial t-design. Similarly, we say that the shell \(C_\ell \) is a combinatorial t-\((v, k, (\lambda _1,\ldots ,\lambda _N))\)-design if \((\Omega , \mathcal {B}(C_\ell ))\) is a combinatorial t-\((v, k, (\lambda _1,\dots , \lambda _N))\)-design.
2.2 Jacobi poynomials
Let C be a q-ary code of length n and \(T \subset [n]:= \{1,\ldots ,n\}\). Then the Jacobi polynomial of C with T is defined as follows [9]:
where for \(c = (c_1,\dots ,c_n)\),
The Jacobi polynomial of the dual code is written as follows.
Theorem 2.1
[9, Theorem 4] Let C be a q-ary code of length n and \(T \subset [n]\). Then we have
Clearly, we have the following relation between Jacobi polynomials and combinatorial designs.
Proposition 2.2
Let C be a linear code. \(C_\ell \) is a combinatorial t-design if and only if the coefficient of \(z^tx^{n-\ell }y^{\ell -t}\) in \(J_{C, T}\) is independent of the choice of T with \(|T| = t\).
We remark that the Jacobi polynomials are invariant under the automorphisms of codes. In particular, for \(C = RM_q(1, m)\), a map \(\varphi \) such that \(\varphi (\lambda (x) + b') = \lambda (x) + b + b'\) is an automorphism on C. Then, we have the following result.
Proposition 2.3
Let \(C = RM_q(1, m)\), \(T \subset V\), and \(T' = T + v\), where \(v \in V\). Then we have \(J_{C, T} = J_{C, T'}\).
This fact is useful because it suffices to consider the case that T contains zero.
2.3 Notation
We next introduce some notation. Let \(C = RM_q(1, m)\), \(T \subset V\), and \(t = |T|\). For \(c = (\lambda (x) + b)_{x \in V} \in C\) and \(u \in V\), the evaluation of c at u is denoted by c(u), which equals \(\lambda (u) + b\). Let \(i \in \{0,1,\ldots ,t\}\), \(j \in \mathbb {F}_q\), we define
and
Then, the Jacobi polynomial of C with T is written as
We have the following relation between \(a_i\) and \(b_i\).
Lemma 2.4
We have
Proof
Since
we obtain
\(\square \)
Using this lemma, we obtain \(a_i\) by calculating \(b_i\).
3 Proofs of Theorem 1.1 and Corollary 1.2
In this section, we give proofs of Theorem 1.1 and Corollary 1.2 using the notation introduced in Sect. 2.3. First, we give a lemma to show Theorem 1.1. Let \(T = \{ 0, u \} \in \left( {\begin{array}{c}V\\ 2\end{array}}\right) \).
Lemma 3.1
We have
Proof
Considering \(u \in T\) as an element of \(V^{**}\), u is a surjective linear map from \(V^*\) to \(\mathbb {F}_q\) because \(u \ne 0\). Then, for \(j \in \mathbb {F}_q {\setminus } \{0\}\),
Therefore,
\(\square \)
Using this Lemma, we show Theorem 1.1.
Proof of Theorem 1.1
Using Lemmas 2.4 and 3.1, we obtain
Thus, we obtain coefficients of the Jacobi polynomial by (2.1). \(\square \)
Finally, we give a proof of Corollary 1.2.
Proof of Corollary 1.2
By Proposition 2.3, it suffices to show that for any \(T = \{ 0, u\} \subset \left( {\begin{array}{c}V\\ 2\end{array}}\right) \), the coefficient of \(z^2x^{q^m - \ell }y^{\ell -2}\) is the same value. This is true by using Theorem 1.1. In addition, we have the Jacobi polynomial of \(RM_q(1, m)^\perp \) by using Theorem 2.1. Thus, we obtain the desired results. \(\square \)
Remark
Collorary 1.2 can be proved by 2-transitivity of the automorphism group of \(RM_q(1, m)\), which is the general linear homogenious group [2].
4 Proofs of Theorem 1.3 and Corollary 1.4
In this section, we give proofs of Theorem 1.3 and Corollaries 1.4 and 1.5 using the notation introduced in Sect. 2.3. First, we give two lemmas to show Theorem 1.3. Let \(T = \{0, u_1, u_2\}\in \left( {\begin{array}{c}V\\ 3\end{array}}\right) \), \(A = {}^t[u_1\ u_2]\).
Lemma 4.1
If \(\textrm{rank}\, A = 2\), then
Proof
We remark that A is a surjective map from V to \(\mathbb {F}_q^2\), and for all \( a, b \in \mathbb {F}_q, |A^{-1}({}^t[a\ b])| = |\textrm{Ker}\, A| = q^{m - 2}\). Then, for \(j \in \mathbb {F}_q {\setminus } \{0\}\),
and
Since
we obtain the desired results. \(\square \)
Lemma 4.2
If \(\textrm{rank}\, A = 1\), then
Proof
Because \(u_1\) and \(u_2\) are not equal to 0 or each other, there exist \(a, b \in \mathbb {F}_q \setminus \{0\}\) such that \(a \ne b\) and \(\{{}^t[a\ b] \}\) is a basis of \(\textrm{Im}\, A\). Hence, for any \(v \in \textrm{Im}\, A\),
Then, for \(j \in \mathbb {F}_q \setminus \{0\}\), we have
and
Thus, since \(b_i = \sum _{j \in \mathbb {F}_q} b_{i, j}\), we obtain the desired results. \(\square \)
Using these lemmas, we give a proof of Theorem 1.3.
Proof of Theorem 1.3
By Lemmas 2.4 and (2.1), (1) follows from Lemma 4.1, and (2) follows from Lemma 4.2. \(\square \)
Then, we show that the shells of \(RM_q(1, m)\) are not 3-designs if \(q \ge 3\) and \(m \ge 2\).
Proof of Corollary 1.4
Let \(C = RM_q(1, m)\). We give a proof relying on the properties of Jacobi polynomials. Let \(T_1 = \{ 0, u_1, u_2 \} \in \left( {\begin{array}{c}V\\ 3\end{array}}\right) \), \(T_2 = \{ 0, v_1, v_2 \} \in \left( {\begin{array}{c}V\\ 3\end{array}}\right) \), \(A_1 = {}^t[u_1\ u_2]\), and \(A_2 = {}^t[v_1 \ v_2]\). We assume that \(\textrm{rank}\, A_1 = 2\) and \(\textrm{rank}\, A_2 = 1\). Indeed, if \(q \ge 3\) and \(m \ge 2\), there exist such \(T_1, T_2\). By Theorem 1.3,
Since the coefficient of \(z^3x^{q^m-\ell }y^{\ell -3}\) in \(J_{C, T_1} - J_{C, T_2}\) is non-zero whenever \(C_\ell \) is non-empty, \(C_\ell \) is not a 3-design. \(\square \)
By using Theorem 2.1, we obtain
Based on this equation, we conjecture the following.
Conjecture 4.3
Let \(C = RM_q(1, m)\). If \(q \ge 3\), then for any \(\ell \in \mathbb {N}\), \((C^\perp )_\ell \) is not a combinatorial 3-design.
We verified this conjecture for q, m which satisfying \(q^{2\,m} < 10^9\). The computations were performed using the code available at GitHub.Footnote 1
Finally, we claim that the shells of \(RM_q(1, m)\) are 3-\((v,k,(\lambda _1, \lambda _2))\)-designs.
Proof of Corollary 1.5
It is clear from Theorem 1.3.
5 Proof of Theorem 1.6
In this section, we give proofs of Theorem 1.6 and Corollary 1.7 using the notation introduced in Sect. 2.3. Let \(T = \{0, u_1, u_2, u_3\} \in \left( {\begin{array}{c}V\\ 4\end{array}}\right) \), \(A = {}^t[u_1\ u_2\ u_3]\).
Considering A as a linear map from V to \(\mathbb {F}_q^3\), for all \(j \in \mathbb {F}_q\setminus \{0\}\), we have
and for \(j = 0\), we have
Next, we prepare three lemmas for proving Theorem 1.6.
Lemma 5.1
If \(\textrm{rank}\, A = 3\),
Proof
Therefore, we obtain the desired results by Lemma 2.4. \(\square \)
Lemma 5.2
If \(\textrm{rank}\, A = 1\),
Proof
Since \(u_1, u_2, u_3\) are different from each other and not equal to 0, we take a basis \(\{{}^t[a\ b\ c]\}\) of \(\textrm{Im}\, A \), where \(a, b, c \in \mathbb {F}_q{\setminus }\{0\}\) and are different from each other. If \(\textrm{rank}\, A = 1\), then for all \(v \in \textrm{Im}\, A\), \(|A^{-1}(v)| = q^{m-1}\). Then, for all \(j \in \mathbb {F}_q{\setminus }\{0\}\),
and
Therefore, \(b_0,\dots ,b_4\) are written as follows:
Thus, we obtain \(a_0,\dots ,a_4\) by using Lemma 2.4. \(\square \)
Before stating the lemma under the condition of \(\textrm{rank}\, A = 2\), we give a basis of \(\textrm{Im}\, A\). Since \(\textrm{Im}\, A\) is invariant under the right multiplication of an invertible matrix to A, we confine a basis of \(\textrm{Im}\, A\) to the following:
where \(a, b \in \mathbb {F}_q\). However, since \(u_1, u_2, u_3\) are not equal to 0, the last one is excluded. Without loss of generality, we take the first one because \(b_{i, j}\) is invariant under a permutation on indices of codewords. Note that we have \((a, b) \ne (0,0), (1,0), (0,1)\) because \(u_1, u_2, u_3 \ne 0\).
Lemma 5.3
If \(\textrm{rank}\, A = 2\), we have the following.
-
1.
If \(a + b = 1\) or \(ab = 0\), then
$$\begin{aligned} a_0= & {} q^{m - 2} - 1,\ a_1 = q^{m - 2}(q - 1),\ a_2 = 3q^{m - 2}(q - 1),\\ a_3= & {} q^{m - 2}(q - 1)(4q - 5),\ a_4 = (q - 1)(q^m - 3q^{m - 1} + 2q^{m - 2} - 1). \end{aligned}$$ -
2.
If \(a + b \ne 1\) and \(ab \ne 0\), then
$$\begin{aligned} a_0= & {} q^{m - 2} - 1,\ a_1 = 0,\ a_2 = 6q^{m - 2}(q - 1),\\ a_3= & {} q^{m - 2}(q - 1)(4q - 8),\ a_4 = (q - 1)(q^m - 3q^{m - 1} + 3q^{m - 2} - 1). \end{aligned}$$
Proof
First, we give \(b_0\). Clearly, \(b_{0, 0} = 0\). For all \(j \in \mathbb {F}_q{\setminus }\{0\}\),
We have
If \(a = 0\), then \(b \ne 0, 1\), and if \(b = 0\), then \( a \ne 0, 1\). Thus,
Therefore,
Hence,
Second, we compute \(b_1\). Similarly,
Fix \(j \in \mathbb {F}_q\setminus \{0\}\), and let \(I_1\), \(I_2\), and \(I_3\) be non-negative numbers such that
Then, \(b_{1, j} = q^{m - 2} \times (I_1 + I_2 + I_3)\). We have
Therefore,
Similarly, we give \(b_3\). For all \(j \in \mathbb {F}_q{\setminus }\{0\}\), we have
Let \(J_1\), \(J_2\), and \(J_3\) be non-negative integers such that
Clearly, \(J_3 = 0\). We have
Thus,
Therefore,
and we have \(b_{4, j} = 0\), where \(j \in \mathbb {F}_q{\setminus }\{0\}\), and \(b_{4, 0} = |\textrm{Ker}\, A| = q^{m-2}\). Then we have
Finally, by using Lemma 2.4, we obtain \(a_0, \dots , a_4\) as follows:
\(\square \)
Proof of Theorem 1.6 and Corollary 1.7
Using Lemmas 5.1, 5.2, and 5.3, we obtain the desired results. \(\square \)
References
Assmus E.F. Jr., Mattson H.F. Jr.: New \(5\)-designs. J. Comb. Theory 6, 122–151 (1969).
Berger T., Charpin P.: The automorphism group of generalized Reed–Muller codes. Discret. Math. 117, 1–17 (1993).
Bonnecaze A., Mourrain B., Solé P.: Jacobi polynomials, type II codes, and designs. Des. Codes Cryptogr. 16(3), 215–234 (1999).
Bosma W., Cannon J., Playoust C.: The Magma algebra system. I. The user language. J. Symb. Comput. 24, 235–265 (1997).
Chakraborty H.S., Miezaki T., Oura M., Tanaka Y.: Jacobi polynomials and design theory I. Discret. Math. 346, 113339 (2023).
Miezaki T., Munemasa A.: Jacobi polnomials and harmonic weight enumerators of the first-order Reed-Muller codes and the extended hamming codes, submitted (2023).
Miezaki T., Nakasora H.: The support designs of the triply even binary codes of length 48. J. Comb. Des. 27, 673–681 (2019).
Miezaki T., Munemasa A., Nakasora H.: A note on Assmus-Mattson type theorems. Des. Codes Cryptogr. 89, 843–858 (2021).
Ozeki M.: On the notion of Jacobi polynomials for codes. Math. Proc. Camb. Philos. Soc. 121(1), 15–30 (1997).
Wolfram Research, Inc., Mathematica, Version 11.2, Champaign, IL (2017).
Acknowledgements
The authors would like to thank the anonymous reviewers for their beneficial comments on an earlier version of the manuscript. We are grateful to Professors Tsuyoshi Miezaki and Akihiro Munemasa for helpful discussions and comments on the manuscript.
Author information
Authors and Affiliations
Corresponding author
Ethics declarations
Conflict of interest
The authors have no affiliation with any organization with a direct or indirect financial interest in the subject matter discussed in the manuscript.
Additional information
Communicated by T. Feng.
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
Open Access This article is licensed under a Creative Commons Attribution 4.0 International License, which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons licence, and indicate if changes were made. The images or other third party material in this article are included in the article's Creative Commons licence, unless indicated otherwise in a credit line to the material. If material is not included in the article's Creative Commons licence and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder. To view a copy of this licence, visit http://creativecommons.org/licenses/by/4.0/.
About this article
Cite this article
Yamaguchi, R. Jacobi polynomials for the first-order generalized Reed–Muller codes. Des. Codes Cryptogr. (2024). https://doi.org/10.1007/s10623-024-01392-z
Received:
Revised:
Accepted:
Published:
DOI: https://doi.org/10.1007/s10623-024-01392-z