English
Related papers

Related papers: A Survey on Almost Difference Sets

200 papers

A $(v,k,\lambda)$-difference set in a group $G$ of order $v$ is a subset $\{d_1, d_2, \ldots,d_k\}$ of $G$ such that $D=\sum d_i$ in the group ring ${\mathbb Z}[G]$ satisfies $$D D^{-1} = n + \lambda G,$$ where $n=k-\lambda$. In other…

Combinatorics · Mathematics 2025-04-14 Daniel M. Gordon

Pseudorandom binary sequences with optimal balance and autocorrelation have many applications in stream cipher, communication, coding theory, etc. It is known that binary sequences with three-level autocorrelation should have an almost…

Cryptography and Security · Computer Science 2016-02-22 Minglong Qi , Shengwu Xiong , Jingling Yuan , Wenbi Rao , Luo Zhong

Signed difference sets have interesting applications in communications and coding theory. A $(v,k,\lambda)$-difference set in a finite group $G$ of order $v$ is a subset $D$ of $G$ with $k$ distinct elements such that the expressions…

Combinatorics · Mathematics 2023-06-12 Zhiwen He , Tingting Chen , Gennian Ge

Almost difference sets have emerged as a fascinating and important area of research as they can produce functions with optimal nonlinearity, cyclic codes, and binary sequences with optimal autocorrelation. This study aims to investigate the…

Group Theory · Mathematics 2024-02-01 Benedict Estrella

In this paper we study almost $p$-ary sequences and their autocorrelation coefficients. We first study the number $\ell$ of distinct out-of-phase autocorrelation coefficients for an almost $p$-ary sequence of period $n+s$ with $s$…

Combinatorics · Mathematics 2018-12-24 Büşra Özden , Oğuz Yayla

Using a special metric in the space of sequences, we give a geometric description of almost periodic sets in the $k$-dimensional Euclidean space. We prove the completeness of the space of almost periodic sets and some analogue of the…

Metric Geometry · Mathematics 2010-02-02 S. Favorov , Ye. Kolbasina

Let $G$ be a finite group and $f:G \to {\mathbb C}$ be a function. For a non-empty finite subset $Y\subset G$, let $I_Y(f)$ denote the average of $f$ over $Y$. Then, $I_G(f)$ is the average of $f$ over $G$. Using the decomposition of $f$…

Combinatorics · Mathematics 2020-07-23 Hiroki Kajiura , Makoto Matsumoto , Takayuki Okuda

Pseudorandom sequences with optimal three-level autocorrelation have important applications in CDMA communication systems. Constructing the sequences with three-level autocorrelation is equivalent to finding cyclic almost difference sets as…

Cryptography and Security · Computer Science 2016-03-01 Minglong Qi , Shengwu Xiong , Jinbgling Yuan , Wenbi Rao , Luo Zhong

We give two new constructions of almost difference sets. The first is a generic construction of $(q^{2}(q+1),q(q^{2}-1),q(q^{2}-q-1),q^{2}-1)$ almost difference sets in certain groups of order $q^{2}(q+1)$ ($q$ is an odd prime power) having…

Combinatorics · Mathematics 2018-07-27 Jerod Michel , Qi Wang

For a field $\mathbb{F}$ and integers $d, k$ and $\ell$, a set $A \subseteq \mathbb{F}^d$ is called $(k,\ell)$-nearly orthogonal if all vectors in $A$ are non-self-orthogonal and every $k+1$ vectors in $A$ contain $\ell + 1$ pairwise…

Combinatorics · Mathematics 2025-05-30 Rajko Nenadov , Lander Verlinde

Almost designs ($t$-adesigns) were proposed and discussed by Ding as a certain generalization of combinatorial designs related to almost difference sets. Unlike $t$-designs, it is not clear whether $t$-adesigns need also be $(t-1)$-designs…

Combinatorics · Mathematics 2018-11-19 Jerod Michel , Qi Wang

This paper is devoted to studying difference indices of quasi-regular difference algebraic systems. We give the definition of difference indices through a family of pseudo-Jacobian matrices. Some properties of difference indices are proved.…

Commutative Algebra · Mathematics 2016-07-15 Jie Wang

For a field $\mathbb{F}$ and integers $d$ and $k$, a set ${\cal A} \subseteq \mathbb{F}^d$ is called $k$-nearly orthogonal if its members are non-self-orthogonal and every $k+1$ vectors of ${\cal A}$ include an orthogonal pair. We prove…

Combinatorics · Mathematics 2024-12-13 Ishay Haviv , Sam Mattheus , Aleksa Milojević , Yuval Wigderson

A group G is almost cyclic if there is an element x in G, such that for all g in G, there is an element y in G and an integer n with ygy^{-1} = x^n (that is, every element is conjugate to some power of x). W. Ziller asked whether there are…

Group Theory · Mathematics 2007-05-23 Bruce Ikenaga

Let $G$ be any group and $A$ be an arbitrary subset of $G$ (not necessarily symmetric and not necessarily containing the identity). The $h$-fold product set of $A$ is defined as $$A^{h} :=\lbrace a_{1}.a_{2}...a_{h} : a_{1},\ldots,a_n \in A…

Number Theory · Mathematics 2019-02-18 Arindam Biswas , Wolfgang Alexander Moens

A disjoint $(v,k,k-1)$ difference family in an additive group $G$ is a partition of $G\setminus\{0\}$ into sets of size $k$ whose lists of differences cover, altogether, every non-zero element of $G$ exactly $k-1$ times. The main purpose of…

Combinatorics · Mathematics 2017-05-16 Marco Buratti

In this paper, we study the sequences with (non-consecutive) two zero-symbols and ideal autocorrelation, which are also known as almost $m$-ary nearly perfect sequences. We show that these sequences are equivalent to $\ell$-partial direct…

Combinatorics · Mathematics 2020-05-27 Büşra Özden , Oğuz Yayla

The Gruenberg-Kegel graph $\Gamma(G)$ of a finite group $G$ is the graph whose vertex set is the set of prime divisors of $|G|$ and in which two distinct vertices $r$ and $s$ are adjacent if and only if there exists an element of order $rs$…

Group Theory · Mathematics 2023-02-01 Natalia V. Maslova , Viktor V. Panshin , Alexey M. Staroletov

We call a subset $A$ of the (additive) abelian group $G$ {\it $t$-independent} if for all non-negative integers $h$ and $k$ with $h+k \leq t$, the sum of $h$ (not necessarily distinct) elements of $A$ does not equal the sum of $k$ (not…

Number Theory · Mathematics 2015-12-10 Béla Bajnok , Imre Ruzsa

A difference set with parameters $(v, k, \lambda)$ is a subset $D$ of cardinality $k$ in a finite group $G$ of order $v$, such that the number $\lambda$ of occurrences of $g \in G$ as the ratio $d^{-1}d'$ in distinct pairs $(d, d')\in…

Combinatorics · Mathematics 2026-01-01 Hiroki Kajiura , Makoto Matsumoto
‹ Prev 1 2 3 10 Next ›