11 August 2022 in IEEE Transactions on Information Theory
In this paper, we investigate the power function $F(x)=x^{d}$ over the finite field $\mathbb {F}_{2^{4n}}$ , where $n$ is a positive integer and $d=2^{3n}+2^{2n}+2^{n}-1$ . We prove that this power function is AP $c\text{N}$ with respect to all $c\in \mathbb {F}_{2^{4n}}\setminus \{1\}$ satisfying $c^{2^{2n}+1}=1$ , and we determine its $c$ -differential spectrum. To the best of our knowledge, this is the second class of AP $c\text{N}$ power functions over finite fields of even characteristic. By the same proof ideas, we completely determine the differential spectrum of this function, and give an affirmative answer to a recent conjecture proposed by Budaghyan, Calderini, Carlet, Davidova and Kaleyski.
25 September 2021 in Designs, Codes and Cryptography
9 March 2020 in Designs, Codes and Cryptography
14 November 2019 in IEEE Transactions on Communications
5 July 2024 in IEEE Transactions on Information Theory
Abstract-In this paper, we construct infinitely many families of distance-optimal binary BCH codes with the minimum distance 6 and an infinite family of distance-optimal quaternary BCH codes with the minimum distance 4. We also construct several infinite families of cyclic and negacyclic BCH codes over F 2 , F 3 , F 4 , F 5 , F 7 and F 9 with good parameters n , k , d , such that the maximal possible minimum distance d max of a linear [ n , k ] q code is at most d max ≤ d + 8. Many codes in these families have optimal or best known minimum distances. 145 optimal or best known codes are constructed as cyclic codes, negacyclic codes, their shortening codes and punctured codes. Several infinite families of rate 1/2 negacyclic [ n , n +1/2, d ] q codes or [ n , n /2, d ] q codes, such that their minimum distances satisfy d ≥ cn /log q n , where c is a positive constant, are also constructed. These are first several families of such negacyclic codes reported in the literature.
1 November 2024 in Finite Fields and Their Applications