Recently, subfield codes of some optimal linear codes have been studied. In this paper, we further investigate a class of subfield codes and generalize the results of the subfield codes of the conic codes in Ding and Wang (Finite Fields Appl. 56, 308–331, 2020). The weight distributions of these subfield codes and the parameters of their duals are determined. Some of the presented codes are optimal

DNA storage has emerged as an important area of research. The reliability of a DNA storage system depends on designing those DNA strings (called DNA codes) that are sufficiently dissimilar. In this work, we introduce DNA codes that satisfy the newly introduced constraint, a generalization of the non-homopolymers constraint. In particular, each codeword of the DNA code has the specific property that

In this study we consider Euclidean and Hermitian self-dual codes over the direct product ring \(\mathbb {F}_{2} \times (\mathbb {F}_{2}+v\mathbb {F}_{2})\) where v2 = v. We obtain some theoretical outcomes about self-dual codes via the generator matrices of free linear codes over \(\mathbb {F}_{2} \times (\mathbb {F}_{2}+v\mathbb {F}_{2})\). Also, we obtain upper bounds on the minimum distance of

Subfield codes of linear codes over finite fields have recently received a lot of attention, as some of these codes are optimal and have applications in secrete sharing, authentication codes and association schemes. In this paper, two families of binary subfield codes with a few weights are presented from two special classes of linear codes, and their parameters are explicitly determined. Moreover

Symbol-pair code is a new coding framework proposed to combat pair-errors in symbol-pair read channels. Remarkably, a classical maximum distance separable (MDS) code is also an MDS symbol-pair code. In this paper, we investigate the symbol-pair weight distribution of MDS codes and the symbol b-weight distribution of simplex codes over finite fields respectively. Surprisingly, one can derive that all

Substitution functions (S-boxes) play an important role in the security of AES-like cryptosystems, but the cryptosystems are highly vulnerable against fault injection attacks. Some research has been carried out previously to prevent fault injection attacks on AES, but most of the countermeasures are restricted to the detection of faults only, and they only work at the cost of large hardware needed

In this paper, we study the relationship between algebraic manipulation detection (AMD) codes and highly nonlinear functions. As applications, on one hand, a generic construction for systematic AMD codes is introduced based on highly nonlinear functions. Systematic AMD codes with new parameters can be generated from known highly nonlinear functions. Especially, several infinite classes of optimal systematic

Let λ be a unit of the finite commutative chain ring \(R=\mathbb {F}_{p^{m}}+u\mathbb {F}_{p^{m}}+u^{2}\mathbb {F}_{p^{m}}=\{\alpha +u\upbeta +u^{2}\gamma : \alpha ,\upbeta ,\gamma \in \mathbb { F}_{p^{m}}\}\) with u3 = 0, where p is an odd prime and m is a positive integer. In this paper, we consider any λ-constacyclic codes of length 2ps over R. In the case of square λ = δ2, where δ ∈ R, the algebraic

This paper contributes to compute the 2-adic complexity of two classes of Ding-Helleseth generalized cyclotomic sequences. Results show that the 2-adic complexity of these sequences is good enough to resist the attack by the rational approximation algorithm.

In this paper, we propose a mechanism for the construction of MDS codes with arbitrary dimensions of Euclidean hulls. Precisely, we construct (extended) generalized Reed-Solomon (GRS) codes with assigned dimensions of Euclidean hulls from self-orthogonal GRS codes. It turns out our constructions are more general than previous works on Euclidean hulls of (extended) GRS codes.

In this paper, we consider an interpolation-based decoding algorithm for a large family of maximum rank distance codes, known as the additive generalized twisted Gabidulin codes, over the finite field \(\mathbb {F}_{q^{n}}\) for any prime power q. This paper extends the work of the conference paper Li and Kadir (2019) presented at the International Workshop on Coding and Cryptography 2019, which decoded

We discuss a special class of permutation polynomials over finite fields focusing on some recent work on their factorization. In particular we obtain permutation polynomials with various factorization patterns that are favoured for applications. We also address a wide range of problems of current interest concerning irreducible factors of the terms of sequences and iterations of such permutation polynomials

Multiplicative complexity (MC) is defined as the minimum number of AND gates required to implement a function with a circuit over the basis (AND, XOR, NOT). Boolean functions with MC 1 and 2 have been characterized in Fisher and Peralta (2002), and Find et al. (IJICoT 4(4), 222–236, 2017), respectively. In this work, we identify the affine equivalence classes for functions with MC 3 and 4. In order

In this paper, we present two new constructions of complex codebooks with multiplicative characters, additive characters and trace functions over finite fields, and determin the maximal cross-correlation amplitude of these codebooks. We prove that the codebooks we constructed are asymptotically optimal with respect to the Welch bound. Moreover, in the first construction, we generalize the result in

Bent functions in odd characteristic can be either (weakly) regular or non-weakly regular. Furthermore one can distinguish between dual-bent functions, which are bent functions for which the dual is bent as well, and non-dual bent functions. Whereas a weakly regular bent function always has a bent dual, a non-weakly regular bent function can be either dual-bent or non-dual-bent. The classical constructions

We define affine equivalence of S-boxes with respect to modular addition, and explore its use in cryptanalysis. We have identified classes of small bijective S-boxes with respect to this new equivalence, and experimentally computed their properties.

The Fischer result about distinctness of the Kloosterman sums on F∗p is extended for the finite fields of degrees of extension that are powers of 2. To obtain the desired outcome, we give an elementary proof of the fact that there does not exist a pair of Kloosterman sums on same odd characteristic fields which are opposite to each other.

Recently, Carlet introduced (Carlet Finite. Fields Appl. 53, 226–253 (2018)) the concept of component-wise uniform (CWU) functions which is a stronger notion than being almost perfect nonlinear (APN). Carlet showed that crooked functions (in particular quadratic functions, including Gold functions) and the compositional inverse of a specific Gold function are CWU. Carlet also compiled a table on the

In this paper we define a new transform on (generalized) Boolean functions, which generalizes the Walsh-Hadamard, nega-Hadamard, 2k-Hadamard, consta-Hadamard and all HN-transforms. We describe the behavior of what we call the root-Hadamard transform for a generalized Boolean function f in terms of the binary components of f. Further, we define a notion of complementarity (in the spirit of the Golay

A special function is a function either of special form or with a special property. Special functions have interesting applications in coding theory and combinatorial t-designs. The main objective of this paper is to survey t-designs constructed from special functions, including quadratic functions, almost perfect nonlinear functions, almost bent functions, bent functions, bent vectorial functions

The boomerang attack, introduced by Wagner in 1999, is a cryptanalysis technique against block ciphers based on differential cryptanalysis. In particular it takes into consideration two differentials, one for the upper part of the cipher and one for the lower part, and it exploits the dependency of these two differentials. At Eurocrypt’18, Cid et al. introduced a new tool, called the Boomerang Connectivity

A bent function is a Boolean function in even number of variables which is on the maximal Hamming distance from the set of affine Boolean functions. It is called self-dual if it coincides with its dual. It is called anti-self-dual if it is equal to the negation of its dual. A mapping of the set of all Boolean functions in n variables to itself is said to be isometric if it preserves the Hamming distance

Let f(x) = xd be a power mapping over \(\mathbb {F}_{n}\) and \(\mathcal {U}_{d}\) the maximum number of solutions \(x\in \mathbb {F}_{n}\) of \({\Delta }_{f,c}(x):=f(x+c)-f(x)=a\text {, where }c,a\in \mathbb {F}_{n}\text { and } c\neq 0\). f is said to be differentially k-uniform if \(\mathcal {U}_{d} =k\). The investigation of power functions with low differential uniformity over finite fields \(\mathbb

Inspired by a recent work of Tang et al. on constructing bent functions [14, IEEE TIT, 63(1): 6149-6157, 2017], we introduce a property (Pτ) of any Boolean function that its second order derivatives vanish at any direction (ui,uj) for some τ-subset {u1,…,uτ} of \(\mathbb {F}_{2^{n}}\), and then establish a link between this property and the construction of Tang et al. (IEEE Trans. Inf. Theory 63(10)

Linear codes have a wide range of applications in the data storage systems, communication systems, consumer electronics products since their algebraic structure can be analyzed and they are easy to implement in hardware. How to construct linear codes with excellent properties to meet the demands of practical systems becomes a research topic, and it is an efficient way to construct linear codes from

We consider n-bit permutations with differential uniformity of 4 and null nonlinearity. We first show that the inverses of Gold functions have the interesting property that one component can be replaced by a linear function such that it still remains a permutation. This directly yields a construction of 4-uniform permutations with trivial nonlinearity in odd dimension. We further show their existence

Let \(\mathbb {F}_{2^{m}}\) be the finite field with 2m elements, where m is a positive integer. Recently, Heng and Ding in (Finite Fields Appl. 56:308–331, 2019) studied the subfield codes of two families of hyperovel codes and determined the weight distribution of the linear code $$ \mathcal{C}_{a,b}=\left\{((\text{Tr}_{1}^{m}(a f(x)+bx)+c)_{x \in \mathbb{F}_{2^{m}}}, \text{Tr}_{1}^{m}(a), \text{Tr}_{1}^{m}(b))

We correct some mistakes in the paper “A mass formula for negacyclic codes of length 2k and some good negacyclic codes over \(\mathbb {Z}_{4}+u\mathbb {Z}_{4}\)” (Bandi et al. Cryptogr. Commun. 9, 241–272, 2017).

A bent4 function is a Boolean function with a flat spectrum with respect to a certain unitary transform \(\mathcal {T}\). It was shown previously that a Boolean function f in an even number of variables is bent4 if and only if f + σ is bent, where σ is a certain quadratic function depending on \(\mathcal {T}\). Hence bent4 functions are also called shifted bent functions. Similarly, a Boolean function

The concept of a locally repairable code (LRC) was introduced to protect the data from disk failures in large-scale storage systems. In this paper, we consider the LRCs with multiple disjoint repair sets and each repair set contains exactly one check symbol. By using several structures from combinatorial design theory, such as balanced incomplete block design, cyclic packing, group divisible design

The original version of this article unfortunately contained a mistake in the main title.

In this paper we study almost p-ary sequences and their autocorrelation coefficients. We first study the number ℓ of distinct out-of-phase autocorrelation coefficients for an almost p-ary sequence of period n + s with s consecutive zero-symbols. We prove an upper bound and a lower bound on ℓ. It is shown that ℓ can not be less than \(\min \limits \{s,p,n\}\). In particular, it is shown that a nearly

Recently Budaghyan et al. (Cryptogr. Commun. 12, 85–100, 2020) introduced a procedure for investigating if CCZ-equivalence can be more general than EA-equivalence together with inverse transformation (when applicable). In this paper, we show that it is possible to use this procedure for classifying, up to EA-equivalence, all known APN functions in dimension 6. We also give some discussion for dimension

For a Distributed Storage System (DSS), the Fractional Repetition (FR) code is a class in which replicas of encoded data packets are stored on distributed chunk servers, where the encoding is done using the Maximum Distance Separable (MDS) code. The FR codes allow for the exact uncoded repair with minimum repair bandwidth. In this paper, FR codes (called Flower codes) are constructed using finite binary

The set of linear structures of most known balanced Boolean functions is non-trivial. In this paper, some balanced Boolean functions whose set of linear structures is trivial are constructed. We show that any APN function in even dimension must have a component whose set of linear structures is trivial. We determine a general form for the number of bent components in quadratic APN functions in even

This paper presents an explicit representation for the solutions of the equation \({\sum }_{i=0}^{\frac kl-1}x^{2^{li}} = a \in \mathbb {F}_{2^{n}}\) for any given positive integers k, l with l|k and n, in the closed field \({\overline {\mathbb {F}_{2}}}\) and in the finite field \(\mathbb {F}_{2^{n}}\). As a by-product of our study, we are able to completely characterize the a’s for which this equation

We consider a special type of sequence of arithmetic progressions, in which consecutive progressions are related by the property: ithterms ofjth, (j + 1)thprogressions of the sequence are multiplicative inverses of each other modulo(i + 1)thterm ofjthprogression. Such a sequence is uniquely defined for any pair of co-prime numbers. A computational problem, defined in the context of such a sequence

In 2018, Ding et al. introduced a new generalisation of the punctured binary Reed-Muller codes to construct LCD codes and 2-designs. They studied the minimum distance of the codes and proposed an open problem about the minimum distance. In this paper, several new results on the minimum distance of the generalised punctured binary Reed- Muller are presented. Particularly, some of the results are a generalisation

We present new families of three-dimensional (3-D) optical orthogonal codes for applications to optical code-division multiple access (OCDMA) networks. The families are based in the extended rational cycle used for the 2-D Moreno-Maric construction. The new families are asymptotically optimal with respect to the Johnson bound.

We introduce almost supplementary difference sets (ASDS). For odd m, certain ASDS in \(\mathbb Z_{m}\) that have amicable incidence matrices are equivalent to quaternary sequences of odd length m with optimal autocorrelation. As one consequence, if 2m − 1 is a prime power, or m ≡ 1 mod 4 is prime, then ASDS of this kind exist. We also explore connections to optimal binary sequences and group cohomology

In this work, we describe a double bordered construction of self-dual codes from group rings. We show that this construction is effective for groups of order 2p where p is odd, over the rings \(\mathbb {F}_{2}+u\mathbb {F}_{2}\) and \(\mathbb {F}_{4}+u\mathbb {F}_{4}\). We demonstrate the importance of this new construction by finding many new binary self-dual codes of lengths 64, 68 and 80; the new

In this paper, we show that LCD codes are not equivalent to non-LCD codes over small finite fields. The enumeration of binary optimal LCD codes is obtained. We also get the exact value of LD(n,2) over \(\mathbb {F}_{3}\) and \(\mathbb {F}_{4}\), where LD(n,2) := max{d∣thereexsitsan [n,2, d] LCD\( code~ over~ \mathbb {F}_{q}\}\). We study the bound of LCD codes over \(\mathbb {F}_{q}\) and generalize

Several classes of quaternary sequences of even period with optimal autocorrelation have been constructed by Su et al. based on interleaving certain kinds of binary sequences of odd period, i.e. Legendre sequence, twin-prime sequence and generalized GMW sequence. In this correspondence, the exact values of linear complexity over finite field \(\mathbb {F}_{4}\) and Galois ring \(\mathbb {Z}_{4}\) of

Sequence families with zero correlation zone (ZCZ) have been extensively studied in recent years due to their important applications in quasi-synchronous code-division multiple-access (QS-CDMA) systems. To accommodate multiuser environments, multiple ZCZ sequence sets with low inter-set cross-correlation are expected. In this paper, we propose a construction of polyphase ZCZ sequences based on generalised

In this paper, a new and simple method for the construction of Girth-6 (J,L) Quasi-Cyclic Low-Density Parity-Check (QC-LDPC) codes is proposed. The method is further extended to the search of Girth-8 QC-LDPC codes with base matrices of order 3 × L and 4 × L. The construction is based on three different forms of exponent matrices and the parameters α, p, and q which satisfy the necessary algebraic conditions

A set \(S \subseteq {{\mathbb {F}}_{2}^{n}}\) is called degree-d zero-sum if the sum \({\sum }_{s \in S} f(s)\) vanishes for all n-bit Boolean functions of algebraic degree at most d. Those sets correspond to the supports of the n-bit Boolean functions of degree at most n − d − 1. We prove some results on the existence of degree-d zero-sum sets of full rank, i.e., those that contain n linearly independent

We present a new construction of a family of perfect ternary sequences (PTSs) that is a generalization of one of the known families of PTSs. These PTSs of length N1N2 are derived from shift sequences of odd length N1 corresponding to m-sequences over GF(p) and PTSs of odd length N2. Ipatov PTSs are a special case where N2 = 1. For N2 ≥ 3, we find conditions under which the obtained PTSs are new. We

Recently, a class of binary sequences with optimal autocorrelation magnitude has been presented by Su et al. based on Ding-Helleseth-Lam sequences and interleaving technique (Designs, Codes and Cryptography 86, 1329–1338, 2018). The linear complexity of this class of sequences has been proved to be large enough to resist the B-M Algorithm by Fan (Designs, Codes and Cryptography 86, 2441–2450, 2018)

Determine the number of the rational zeros of any given linearized polynomial is one of the vital problems in finite field theory, with applications in modern symmetric cryptosystems. But, the known general theory for this task is much far from giving the exact number when applied to a specific linearized polynomial. The first contribution of this paper is a better general method to get a more precise

Complementary sequences with quadrature amplitude modulation (QAM) symbols have important applications in OFDM communication systems. The objective of this paper is to present two constructions of 16-QAM complementary sequence sets of size 4. The first construction generates four complementary sequences of length L = 2m− 1 + 2v, where m and v are two positive integers with 1 ≤ v ≤ m − 1. The second

A quaternary sequence is said to be optimal if its odd-periodic autocorrelation magnitude equal to 2 for even length, and 1 for odd length. In this paper, we propose three constructions of optimal quaternary sequences: the first construction applies the inverse Gray mapping to four component binary sequences, which could be chosen from GMW sequence pair, twin-prime sequence pair, Legendre sequence

Due to the wide applications in communications, data storage and cryptography, linear codes have received much attention in the past decades. As a subclass of linear codes, minimal linear codes can be used to construct secret sharing with nice access structure. The objective of this paper is to construct new classes of minimal binary linear codes with \(w_{\min \limits }/w_{\max \limits }\leq 1/2\)

Constacyclic codes are a subclass of linear codes and have been well studied. Constacyclic BCH codes are a family of constacyclic codes and contain BCH codes as a subclass. Compared with the in-depth study of BCH codes, there are relatively little study on constacyclic BCH codes. The objective of this paper is to determine the dimension and minimum distance of a class of q-ary constacyclic BCH codes

Some classes of binary codes constructed by using some defining sets are studied, and for most defining sets, we will determine the generalized Hamming weight of the corresponding codes completely, and for other defining sets, we will determine part of the generalized Hamming weight of the corresponding codes.

This paper generalizes three constructions of families of sequences with bounded off peak correlation with application to Code Division Multiple Access (CDMA), frequency hopping, and Ultra Wide Band (UWB). These new families present flexible family sizes and sequence lengths, making them well suited to wireless communications and Multiple Input Multiple Output (MIMO) radar. In particular, we show that

Linear complementary dual codes (or codes with complementary duals) are codes whose intersections with their dual codes are trivial. We study the largest minimum weights d(n,k) among all binary linear complementary dual [n,k] codes. We determine d(n,4) for n ≡ 2,3,4,5,6,9,10,13 (mod 15), and d(n,5) for n ≡ 3,4,5,7,11,19,20, 22,26 (mod 31). Combined with known results, d(n,k) are also determined for

Let \(R=\mathbb {Z}_{4}[v]/\langle v^{2}+2v\rangle \). Then R is a local non-principal ideal ring of 16 elements. First, we give the structure of every cyclic code of odd length n over R and obtain a complete classification for these codes. Then we determine the cardinality, the type and its dual code for each of these cyclic codes. Moreover, we determine all self-dual cyclic codes of odd length n

In this paper, we study two special subsets of a finite field of odd characteristics associated with non-weakly regular bent functions. We show that those subsets associated to non-weakly regular even bent functions in the GMMF class (see Çesmelioğlu et al. Finite Fields Appl. 24, 105–117 2013) are never partial difference sets (PDSs), and are PDSs if and only if they are trivial subsets. Moreover

Based on the parity of the number of occurrences of a pattern 10 as a scattered subsequence in the binary representation of integers, a Rudin-Shapiro-like sequence is defined by Lafrance, Rampersad and Yee. The N th maximum order complexity and the expansion complexity of this Rudin-Shapiro-like sequence are calculated in this paper.

In quasi-synchronous frequency-hopping multiple-access systems where relative delays are restricted within a certain zone, low hit zone frequency-hopping sequences (LHZ FHSs) with favorable partial Hamming correlation properties are desirable. In this paper, we present a new class of LHZ FHS sets with optimal partial Hamming correlation based on t-decimation of m-sequence.