相关论文: Generalized Kasami Sequences: The Large Set

A family of binary sequences is presented and proved to have optimal correlation property and large linear span. It includes the small set of Kasami sequences, No sequence set and TN sequence set as special cases. An explicit lower bound…

Due to wide applications of binary sequences with low correlation to communications, various constructions of such sequences have been proposed in literature. However, most of the known constructions via finite fields make use of the…

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…

In this paper, new families of quadriphase sequences with larger linear span and size have been proposed and studied. In particular, a new family of quadriphase sequences of period $2^n-1$ for a positive integer $n=em$ with an even positive…

The dual of the Kasami code of length $q^2-1$, with $q$ a power of $2$, is constructed by concatenating a cyclic MDS code of length $q+1$ over $F_q$ with a Simplex code of length $q-1$. This yields a new derivation of the weight…

Let $m$, $n$, and $k$ be integers satisfying $0 < k \leq n < 2k \leq m$. A family of sets $\mathcal{F}$ is called an $(m,n,k)$-intersecting family if $\binom{[n]}{k} \subseteq \mathcal{F} \subseteq \binom{[m]}{k}$ and any pair of members of…

Recall that in a laminar family, any two sets are either disjoint or contained one in the other. Here, a parametrized weakening of this condition is introduced. Let us say that a set system $\mathcal{F} \subseteq 2^X$ is $t$-laminar if $A,B…

In the realm of modern digital communication, cryptography, and signal processing, binary sequences with a low correlation properties play a pivotal role. In the literature, considerable efforts have been dedicated to constructing good…

A family $\mathcal{F}$ on ground set $\{1,2,\ldots, n\}$ is maximal $k$-wise intersecting if every collection of $k$ sets in $\mathcal{F}$ has non-empty intersection, and no other set can be added to $\mathcal{F}$ while maintaining this…

We study growth rates of generalised Fibonacci sequences of a particular structure. These sequences are constructed from choosing two real numbers for the first two terms and always having the next term be either the sum or the difference…

The Kolakoski sequence is the unique infinite sequence with values in $\{1,2\}$ and first term $1$ which equals the sequence of run-lengths of itself, we call this $K(1,2).$ We define $K(m,n)$ similarly. A well-known conjecture is that the…

The Kolakoski sequence is the unique infinite sequence with values in $\{1, 2\}$ and first term twems $1, 2, \ldots$ which equals the sequence of run-lengths of itself, we call this $K(1, 2).$ We define $K(m, n)$ similarly for $m+n$ odd. A…

In this paper infinite families of linear binary nested completely regular codes are constructed. They have covering radius $\rho$ equal to $3$ or $4$, and are $1/2^i$-th parts, for $i\in\{1,\ldots,u\}$ of binary (respectively, extended…

Let $p$ be an odd prime such that $p \equiv 3\;{\rm mod}\;4$ and $n$ be an odd integer. In this paper, two new families of $p$-ary sequences of period $N = \frac{p^n-1}{2}$ are constructed by two decimated $p$-ary m-sequences $m(2t)$ and…

In this paper, the construction of finite-length binary sequences whose nonlinear complexity is not less than half of the length is investigated. By characterizing the structure of the sequences, an algorithm is proposed to generate all…

A set system $\mathcal{F}$ is $t$-\textit{intersecting}, if the size of the intersection of every pair of its elements has size at least $t$. A set system $\mathcal{F}$ is $k$-\textit{Sperner}, if it does not contain a chain of length…

Single sequences like Legendre have high linear complexity. Known CDMA families of sequences all have low complexities. We present a new method of constructing CDMA sequence sets with the complexity of the Legendre from new frequency hop…

The construction of complementary sets (CSs) of sequences with different set size and sequence length become important due to its practical application for OFDM systems. Most of the constructions of CSs, based on generalized Boolean…

Let $ k \geq 2 $ be an integer. The $ k- $generalized Fibonacci sequence is a sequence defined by the recurrence relation $ F_{n}^{(k)}=F_{n-1}^{(k)} + \cdots + F_{n-k}^{(k)}$ for all $ n \geq 2$ with the initial values $ F_{i}^{(k)}=0 $…

Let $F_n(k)$ be the generalized Fibonacci number defined by (with $F_i(k)$ abbreviated to $F_i$): $F_n = F_{n-1} + F_{n-2} + \dots + F_{n-k}$, for $n \geq k$, and the initial values $(F_0,F_1,...,F_{k-1})$. Let $B_n(k,j)$ be $F_n(k)$ with…