Related papers: Corrigendum to New Generalized Cyclotomic Binary S…

Via interleaving Ding-Helleseth-Lam sequences, a class of binary sequences of period $4p$ with optimal autocorrelation magnitude was constructed in \cite{W. Su}. Later, Fan showed that the linear complexity of this class of sequences is…

In this paper, we define the linear complexity for multidimensional sequences over finite fields, generalizing the one-dimensional case. We give some lower and upper bounds, valid with large probability, for the linear complexity and…

Let $p > 155$ be a prime and let $G$ be a cyclic group of order $p$. Let $S$ be a minimal zero-sum sequence with elements over $G$, i.e., the sum of elements in $S$ is zero, but no proper nontrivial subsequence of $S$ has sum zero. We call…

Let $p,q$ be distinct primes satisfying $\mathrm{gcd}(p-1,q-1)=d$ and let $D_i$, $i=0,1,\cdots,d-1$, be Whiteman's generalized cyclotomic classes with $Z_{pq}^{\ast}=\cup_{i=0}^{d-1}D_i$. In this paper, we give the values of Gauss periods…

In this paper, for an odd prime $p$, several classes of two-weight linear codes over the finite field $\mathbb{F}_p$ are constructed from the defining sets, and then their complete weight distributions are determined by employing character…

We consider the complexities of substitutive sequences over a binary alphabet. By studying various types of special words, we show that, knowing some initial values, its complexity can be completely formulated via a recurrence formula…

Cyclotomic polynomials are basic objects in Number Theory. Their properties depend on the number of distinct primes that intervene in the factorization of their order, and the binary case is thus the first nontrivial case. This paper sees…

Let $\mathcal{P}$ be a chiral polytope with type $\{k_1, k_2\}$ and $G=Aut(\mathcal{P})$. Suppose $|G|=2p^m$, where $k_1, k_2\geq 3$ and $p$ is an odd prime. Let $P$ be a Sylow $p$-subgroup of $G$. We prove that $G \cong P \rtimes…

Let $p>7$ be a prime, let $G=\Z/p\Z$, and let $S_1=\prod_{i=1}^p g_i$ and $S_2=\prod_{i=1}^p h_i$ be two sequences with terms from $G$. Suppose that the maximum multiplicity of a term from either $S_1$ or $S_2$ is at most $\frac{2p+1}{5}$.…

We study the dynamics of the positive solutions of a second-order, Ricker-type exponential difference equation with periodic parameters. We find that qualitatively different dynamics occur depending on whether the period p of the main…

In this paper, by some arithmetic properties of the Pell sequence and some $p$-adic tools, we study certain cyclotomic matrices involving squares over finite fields. For example, let $1=s_1,s_2,\cdots,s_{(q-1)/2}$ be all the nonzero squares…

This work brings techniques from the theory of recurrent integer sequences to the problem of balancedness of symmetric Boolean functions. In particular, the periodicity modulo $p$ ($p$ odd prime) of exponential sums of symmetric Boolean…

It has been noticed that all the known binary sequences having the asymptotic merit factor $\ge 6$ are the modifications to the real primitive characters. In this paper, we give a new modification of the character sequences at length…

In this paper we study some sophisticated supercongruences involving dual sequences. For $n=0,1,2,\ldots$ define $$d_n(x)=\sum_{k=0}^n\binom nk\binom xk2^k$$ and $$s_n(x)=\sum_{k=0}^n\binom nk\binom xk\binom{x+k}k=\sum_{k=0}^n\binom…

The projective special linear group $\PSL_2(n)$ is $2$-transitive for all primes $n$ and $3$-homogeneous for $n \equiv 3 \pmod{4}$ on the set $\{0,1, \cdots, n-1, \infty\}$. It is known that the extended odd-like quadratic residue codes are…

New families of Cameron-Liebler line classes of ${\rm PG}(3,q)$, $q\ge 7$ odd, with parameter $(q^2+1)/2$ are constructed.

R. Hofer and A. Winterhof proved that the 2-adic complexity of the two-prime (binary) generator of period $pq$ with two odd primes $p\neq q$ is close to its period and it can attain the maximum in many cases. When the two-prime generator is…

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…

Sequences with good randomness properties are quite important for stream ciphers. In this paper, a new class of quaternary sequences is constructed by using generalized cyclotomic classes of $\mathbb{Z}_{2p^m}$ $(m\geq1)$. The exact values…

A general description of the Vi\`ete coefficients of the gaussian period polynomials is given, in terms of certain symmetric representations of the subgroups and the corresponding quotient groups of the multiplicative group…