Related papers: Linear Complexity of Ding-Helleseth Generalized Cy…
For the multiple differential algebra of iterated differential forms (see math.DG/0605113 and math.DG/0609287) on a diffiety (O,C) an analogue of C-spectral sequence is constructed. The first term of it is naturally interpreted as the…
This paper deals with the complexity of strings, which play an important role in biology (nucleotid sequences), information theory and computer science. The d-complexity of a string is defined as the number of its distinct d-substrings…
In connection with generalized cluster algebras we introduce a certain generalization of the celebrated Rogers dilogarithm, which we call the Rogers dilogarithms of higher degree. We show that there is an identity of these generalized…
We derive B\'ezout identities for the minimal polynomials of a finite sequence and use them to prove a theorem of Wang and Massey on binary sequences with a perfect linear complexity profile. We give a new proof of Rueppel's conjecture and…
In this paper we study the general group classification of systems of linear second-order ordinary differential equations inspired from earlier works and recent results on the group classification of such systems. Some interesting results…
We study pattern densities in binary sequences, finding optimal limit sequences with fixed pattern densities.
We provide a lower bound on the complexity function of a typical (in the Lebesgue measure sence) right triangular billiard.
We give a broad survey of inequalities for the number of linear extensions of finite posets. We review many examples, discuss open problems, and present recent results on the subject. We emphasize the bounds, the equality conditions of the…
Linearization of coupled second order nonlinear ordinary differential equations (SNODEs) is one of the open and challenging problems in the theory of differential equations. In this paper we describe a simple and straightforward method to…
We revisit recent work of Heath-Brown on the average order of the quantity r(L_1)r(L_2)r(L_3)r(L_4), for suitable binary linear forms L_1,..., L_4, for integers ranging over quite general regions. In addition to improving the error term in…
A fast algorithm is presented for determining the linear complexity and the minimal polynomial of periodic sequences over GF(q) with period q n p m, where p is a prime, q is a prime and a primitive root modulo p2. The algorithm presented…
The linear complexity of a sequence has been used as an important measure of keystream strength, hence designing a sequence which possesses high linear complexity and $k$-error linear complexity is a hot topic in cryptography and…
Cyclic codes are an interesting type of linear codes and have applications in communication and storage systems due to their efficient encoding and decoding algorithms. They have been studied for decades and a lot of progress has been made.…
We define a family of quaternary sequences over the residue class ring modulo $4$ of length $pq$, a product of two distinct odd primes, using the generalized cyclotomic classes modulo $pq$ and calculate the discrete Fourier transform (DFT)…
We prove tightness of right logarithmic asymptotic of Varshamov- Gilbert bound for linear binary codes We find general asymptotic coding bound for linear codes
We fully classify completely multiplicative sequences which are given by generalised polynomial formulae, and obtain a similar result for (not necessarily completely) multiplicative sequences under the additional restriction that the…
In this paper, we list several interesting structures of cyclotomic polynomials: specifically relations among blocks obtained by suitable partition of cyclotomic polynomials. We present explicit and self-contained proof for all of them,…
We study the complexity of the model checking problem, for fixed model A, over certain fragments L of first-order logic. These are sometimes known as the expression complexities of L. We obtain various complexity classification theorems for…
In this paper, the 2-adic complexity of a class of balanced Whiteman generalized cyclotomic sequences of period $pq$ is considered. Through calculating the determinant of the circulant matrix constructed by one of these sequences, we derive…
It will be proved that a $k$-clique in the $1$-skeleton of either the order polytope or the chain polytope corresponds to the $(k-1)$-face, which is a simplex, in each polytope. These results generalize the known explicit descriptions of…