LCD codes from tridiagonal Toeplitz matrices
Introduction
Linear Complementary Dual (LCD) codes are linear codes which intersect their dual trivially. They were introduced by Massey in 1992 to solve a problem in Information Theory [10]. They were proved to be asymptotically good by Sendrier [11], who used them in relation with equivalence testing of linear codes [12]. They enjoyed a renewal of interest in 2016, with an application to side-channel attacks on embarked cryptosystems [5]. Recently LCD double circulant codes or double negacirculant codes were constructed over various alphabets [8], [13], [14], [15], [17]. A far reaching generalization of both double circulant and double negacirculant codes is that of double Toeplitz codes [16]. In the present paper, we introduce a class of double Toeplitz codes which can be effectively tested for being LCD.
A code is double Toeplitz (DT) if its generator matrix is of the form with I an identity matrix, and T a Toeplitz matrix of the same order. Recall that a matrix is Toeplitz if it has constant entries on all diagonals parallel to the main diagonal. Thus circulant matrices and negacirculant matrices are Toeplitz.
It is easy to check that such a code is LCD iff −1 is not an eigenvalue of . To make that condition easy to check we will make two hypotheses on T:
- •
implying ;
- •
T is tridiagonal, in the sense that if .
In the next section, we show that the characteristic polynomial of a tridiagonal symmetric Toeplitz matrix satisfies a three-term recurrence that can be identified, up to an easy change of variable to that of the Dickson polynomials [9]. The roots of these polynomials can be determined explicitly [3]. Hence we obtain an exact and explicit characterization on whether a given DT code is LCD or not, when T is tridiagonal and symmetric (see Theorem 2.9, Theorem 2.10 below). It seems very difficult to obtain such a characterization for arbitrary Toeplitz T. Moreover this is the first paper in the literature using factorization of Dickson polynomials for the characterization of some LCD codes as far as we know.
Under some mild arithmetic conditions we can show that this spectrum does not intersect the base field, and in particular does not contain −1. Some sufficient conditions for the DT code to be LCD follow. Since the DT codes so constructed have minimum distance at most three, a rather sophisticated concatenation process, namely isometry (see Definition 3.1 below) can be used to construct an LCD code over a small field. Note that because of the fundamental result that any linear code over with is equivalent to an LCD code [6], the theory of LCD codes is focusing on the cases of and . Using the said concatenation process optimal or quasi-optimal LCD codes over these two fields are explicitly constructed.
The material is organized as follows. The next section studies the spectrum of Toeplitz matrices. Section 3 describes a concatenation process that allow for LCD codes over small fields. Numerical examples are given there. The last section concludes the paper.
Section snippets
A spectral lemma
Throughout this paper, let p be a prime, for a positive integer s. Let denote the finite field of q elements. Let denote an algebraic closure of .
Lemma 2.1 For let A be an matrix over . We have the following cases: −1 is an eigenvalue of if and only if −1 is an eigenvalue of A. −1 is an eigenvalue of if and only if −μ or μ is an eigenvalue of A, where with .
Proof
If is even, then which completes the proof in this
Concatenation
In this section we construct LCD codes over with prescribed large minimum distance using DT that we characterize in Theorem 2.9, Theorem 2.10 over an extension field and a kind of concatenation. It is not difficult to observe that most of the concatenation maps do not work as they would not respect LCD property over the base and the extension fields. Hence we use an isometry map, which is introduced in [7] as a special concatenation respecting LCD property. The minimum distance of the DT
Conclusion
In this paper we have constructed LCD double Toeplitz codes from tridiagonal symmetric Toeplitz matrices. It would be worthwhile to extend these results to symmetric Toeplitz matrices with more than three nontrivial diagonals. We conjecture that this might require multivariate Dickson polynomials [9]. This might help to construct DT codes over small fields without recourse to the concatenation process of the previous section.
Acknowledgement
The first author is supported by the National Natural Science Foundation of China (Grants no. 12071001 and 61672036), the Excellent Youth Foundation of Natural Science Foundation of Anhui Province (1808085J20), Professor Ferruh Özbudak is supported partially by METU Coordinatorship of Scientific Research Projects via grant GAP-101-2021-10755.
References (17)
- et al.
Factoring Dickson polynomials over finite fields
Finite Fields Appl.
(1999) - et al.
The Magma algebra system. I. The user language
J. Symb. Comput.
(1997) - et al.
A new concatenated type construction for LCD codes and isometry codes
Discrete Math.
(2018) Linear codes with complementary duals
Discrete Math.
(1992)- et al.
Double circulant LCD codes over
Finite Fields Appl.
(2019) - et al.
On the minimum weights of binary linear complementary dual codes
Cryptogr. Commun.
(2020) - et al.
On the minimum weights of binary LCD codes and ternary LCD codes
- et al.
Complementary dual codes for counter-measures to side-channel attacks
Adv. Math. Commun.
(2016)
Cited by (34)
On LCD codes from skew symmetric Toeplitz matrices
2024, Finite Fields and their ApplicationsTheory of additive complementary dual codes, constructions and computations
2023, Finite Fields and their ApplicationsOn Toeplitz codes of index t and isometry codes
2023, Discrete MathematicsAdditive cyclic complementary dual codes over F<inf>4</inf>
2022, Finite Fields and their ApplicationsCitation Excerpt :LCD codes enjoyed a new surge of interest after Carlet and Guilley discovered their importance in Boolean masking [3], a countermeasure against side-channel attacks on embarked devices. Recently, LCD codes over different alphabets were widely studied in [9–11,13–15]. The material is organized as follows.
Group LCD and group reversible LCD codes
2022, Finite Fields and their Applications