Related papers: Linear Complexity of Ding-Helleseth Generalized Cy…
Which integer sequences are sequences of generalized weights of a linear code? In this paper, we answer this question for linear block codes, rank-metric codes, and more generally for sum-rank metric codes. We do so under an existence…
In this paper we consider a transformation $L_a$ of sequences of complex numbers. We find the inverse transformation of $L_a$ as well as the inverse of a related transformation $\tilde{L}_a$. We explore a connection to the binomial…
We show that the higher order linear differential equation possesses all solutions of infinite order under certain conditions by extending the work of authors about second order differential equation \cite{dsm2}.
The new method for obtaining a variety of extensions of Hermite polynomials is given. As a first example a family of orthogonal polynomial systems which includes the generalized Hermite polynomials is considered. Apparently, either these…
This paper classifies the complexity of various teaching models by their position in the arithmetical hierarchy. In particular, we determine the arithmetical complexity of the index sets of the following classes: (1) the class of uniformly…
This work introduces a multidimensional generalization of the maximum bisection problem. A mixed integer linear programming formulation is proposed with the proof of its correctness. The numerical tests, made on the randomly generated…
In this paper, we give explicit evaluation for some infinite series involving generalized (alternating) harmonic numbers. In addition, some formulas for generalized (alternating) harmonic numbers will also be derived.
In cryptography, we hope a sequence over $\mathbb{Z}_m$ with period $N$ having larger $m$-adic complexity. Compared with the binary case, the computation of 4-adic complexity of knowing quaternary sequences has not been well developed. In…
The matching complex of a simple graph $G$ is a simplicial complex consisting of the matchings on $G$. Jeli\'c Milutinovi\'c et al. studied the matching complexes of the polygonal line tilings, and they gave a lower bound for the…
We study the worst-case complexity of a non-monotone line search framework that covers a wide variety of known techniques published in the literature. In this framework, the non-monotonicity is controlled by a sequence of nonnegative…
We give a generalization of Wolstenholme's harmonic series congruence for the Lucas sequences.
Certain types of bilinearly defined sets in $\mathbb{R}^n$ exhibit a higher degree of linearity than what is apparent by inspection.
In this study, we investigate Horadam sequence as generalization of linear recurrence equations of order two. By the aid of this sequence we obtain a new generalization for sequences of dual quaternions and dual octonions. Moreover, we…
The $2$-adic complexity has been well-analyzed in the periodic case. However, we are not aware of any theoretical results on the $N$th $2$-adic complexity of any promising candidate for a pseudorandom sequence of finite length $N$ or…
We give a very brief introduction to the machinery of spectral sequences, including the spectral sequence of a bicomplex. We then briefly introduce a generalisation of the spectral sequences of a bicomplex to the spectral sequences of…
We show continuity in generalized weighted Morrey spaces of sub-linear integral operators generated by some classical integral operators and commutators. The obtained estimates are used to study global regularity of the solution of the…
A description of the properties of \L with complex characters is given. By using these, together with the more familiar \L with real characters, it is shown how certain two dimensional lattice sums, which previously could not be put into…
A linear recurrence sequence in a cyclotomic field produces a sequence of the generating fields of each term. We show that the later sequence is periodic after removing the first finite terms, and give a bound of its period. This can be…
The linear complexity and the $k$-error linear complexity of a sequence have been used as important security measures for key stream sequence strength in linear feedback shift register design. By using the sieve method of combinatorics, the…
We relate the computational complexity of finite strings to universal representations of their underlying symmetries. First, Boolean functions are classified using the universal covering topologies of the circuits which enumerate them. A…