Related papers: Corrigendum to New Generalized Cyclotomic Binary S…

Cyclic codes have attracted a lot of research interest for decades. In this paper, for an odd prime $p$, we propose a general strategy to compute the complete weight enumerator of cyclic codes via the value distribution of the corresponding…

We improve lower bounds on the $k$th-order nonlinear complexity of pseudorandom sequences over finite fields and we establish a probabilistic result on the behavior of the $k$th-order nonlinear complexity of random sequences over finite…

Binary periodic sequences with good autocorrelation property have many applications in many aspects of communication. In past decades many series of such binary sequences have been constructed. In the application of cryptography, such…

In the present paper we generate binary pseudorandom sequences using generalized polynomials. A generalized polynomial is a function in whose description we not only allow addition and product (as it is the case in usual polynomials) but…

Generalized Fibonacci-like sequences appear in finite difference approximations of the Partial Differential Equations based upon replacing partial differential equations by finite difference equations. This paper studies properties of the…

Motivated by the constructions of binary sequences by utilizing the cyclic elliptic function fields over the finite field $\mathbb{F}_{2^{n}}$ by Jin \textit{et al.} in [IEEE Trans. Inf. Theory 71(8), 2025], we extend the construction to…

Let $n_1=ef+1$ and $n_2=ef'+1$ be two distinct odd primes with positive integers $e,\ f,\ f'.$ In this paper, the two-prime Whiteman's generalized cyclotomic sequence of order $e=6$ is employed to construct several classes of cyclic codes…

The linear complexity and the $k$-error linear complexity of a binary sequence are important security measures for key stream strength. By studying binary sequences with the minimum Hamming weight, a new tool named as hypercube theory is…

We show that there are good long binary generalized quasi-cyclic self-dual (either Type I or Type II) codes.

We provide upper bounds on the density of a symmetric generalized arithmetic progression lacking nonzero elements of the form h(n) for natural numbers n, or h(p) with p prime, for appropriate polynomials h with integer coefficients. The…

For odd prime numbers $p < q$, let $\Phi_{pq} \in \mathbb{Z}[X]$ be the binary cyclotomic polynomial of order $pq$. In this paper, we prove that the second gap of $\Phi_{pq}$ is the maximum of $r-1$ and $p-r-1$, where $r$ is the remainder…

Orientable sequences of order n are infinite periodic sequences with symbols drawn from a finite alphabet of size k with the property that any particular subsequence of length n occurs at most once in a period in either direction. They were…

We rephrase the Wootters-Fields construction [Ann. Phys., {\bf 191}, 363 (1989)] of a full set of mutually unbiased bases in a complex vector space of dimensions $N=p^r$, where $p$ is an odd prime, in terms of the character vectors of the…

The problem of efficiently characterizing degree sequences of simple hypergraphs is a fundamental long-standing open problem in Graph Theory. Several results are known for restricted versions of this problem. This paper adds to the list of…

Let PCS_p^N denote a set of p binary sequences of length N such that the sum of their periodic auto-correlation functions is a delta-function. In the 1990, Boemer and Antweiler addressed the problem of constructing such sequences. They…

The linear complexity of a periodic sequence over $GF(p^m)$ plays an important role in cryptography and communication [12]. In this correspondence, we prove a result which reduces the computation of the linear complexity and minimal…

This paper investigates coefficients of cyclotomic polynomials theoretically and experimentally. We prove the following result. {{\em If $n=p_1\ldots p_k$ where $p_i$ are odd primes and $p_1<p_2<\ldots<p_r<p_1+p_2<p_{r+1}<\ldots<p_t$ with…

We study the linear periods on $GL_{2n}$ twisted by a character using a new relative trace formula. We establish the relative fundamental lemma and the transfer of orbital integrals. Together with the spectral isolation technique of…

In this paper we obtain some sophisticated combinatorial congruences involving binomial coefficients and confirm two conjectures of the author and Davis. They are closely related to our investigation of the periodicity of the sequence…

Let X be a finite, n-dimensional, r-connected CW complex. We prove the following theorem: If p \geq n/r is an odd prime, then the loop space homology Bockstein spectral sequence modulo p is a spectral sequence of universal enveloping…