相关论文: Avoiding right angles and certain Hamming distance…

Let $q$ be an odd prime power. Combining the discussion of Varnavides and a recent theorem of Ellenberg and Gijswijt, we show that a subset $A\subset{\mathbb F}_q^n$ will contain many non-trivial three-term arithmetic progressions, whenever…

In this paper, we construct explicit families of polynomials $P \in \mathbb{F}_q[x_1,\dots,x_n]$ with large root sets which have restricted intersections with affine lines. We use these sets to make substantial progress on a number of…

We study permutations in $S_n$ that simultaneously avoid the pattern $132$ and satisfy the adjacency bound $|\pi_{i+1} - \pi_i| \leq m$ for all $i$, denoting their number by $A_n^{(m)}$. This combination of a global pattern restriction and…

The Gap-Hamming-Distance problem arose in the context of proving space lower bounds for a number of key problems in the data stream model. In this problem, Alice and Bob have to decide whether the Hamming distance between their $n$-bit…

Fix a vector space over a finite field and a system of linear equations. We provide estimates, in terms of the dimension of the vector space, of the maximum of the sizes of subsets of the space that do not admit solutions of the system…

A $q$-ary code $C$ of length $n$ is a set of $n$-dimensional vectors (code words) with entries in $\{0, \ldots, q-1\}$. We say $C$ has constant weight $w$ if each code word has exactly $w$ nonzero entries. We say $C$ has minimum distance…

A set of lines in $\mathbb{R}^n$ is called equiangular if the angle between each pair of lines is the same. We address the question of determining the maximum size of equiangular line sets in $\mathbb{R}^n$, using semidefinite programming…

We show that for a fixed $q$, the number of $q$-ary $t$-error correcting codes of length $n$ is at most $2^{(1 + o(1)) H_q(n,t)}$ for all $t \leq (1 - q^{-1})n - C_q\sqrt{n \log n}$ (for sufficiently large constant $C_q$), where $H_q(n, t)…

The iterated Johnson bound is the best known upper bound on a size of an error-correcting code in the Grassmannian $\mathcal{G}_q(n,k)$. The iterated Sch\"{o}nheim bound is the best known lower bound on the size of a covering code in…

Starting from a practical use of Reed-Solomon codes in a cryptographic scheme published in Indocrypt'09, this paper deals with the threshold of linear $q$-ary error-correcting codes. The security of this scheme is based on the…

For a set $A\subseteq Q_{n}=\left\{ 0,1\right\} ^{n}$ the $t$-neighbourhood of $A$ is $N^{t}\left(A\right)=\left\{ x\,:\,d\left(x,A\right)\leq t\right\}$, where $d$ denotes the usual graph distance on $Q_{n}$. Harper's vertex-isoperimetric…

The set of points in a metric space is called an $s$-distance set if pairwise distances between these points admit only $s$ distinct values. Two-distance spherical sets with the set of scalar products $\{\alpha, -\alpha\}$,…

Given a set of points $P \subset \mathbb F_q^2$ such that $|P|\geq q^{3/2}$ it is established that $|P|$ determines $\Omega(q^2)$ distinct perpendicular bisectors. It is also proven that, if $|P| \geq q^{4/3}$, then for a positive…

In the realm of rank-metric codes, Maximum Rank Distance (MRD) codes are optimal algebraic structures attaining the Singleton-like bound. A major open problem in this field is determining whether an MRD code can be extended to a longer one…

We call a family $\mathcal{F}$ $(3,2,\ell)$-intersecting if $|A \cap B|+|B \cap C|+|C \cap A| \geq \ell$ for all $A$, $B$, $C \in \mathcal{F}$. We try to look for the maximum size of such a family $\mathcal{F}$ in case when $\mathcal{F}…

Let $S$ be a set of $n$ points in $\mathbb{R}^d$, where $d \geq 2$ is a constant, and let $H_1,H_2,\ldots,H_{m+1}$ be a sequence of vertical hyperplanes that are sorted by their first coordinates, such that exactly $n/m$ points of $S$ are…

Intersecting codes are a classical object in coding theory whose rank-metric analogue has recently been introduced. Although the definition formally parallels the Hamming-metric case, the structure and parameter constraints of rank-metric…

Let $P_{2,2}$ be the orientation of $C_4$ which consists of two 2-paths with the same initial and terminal vertices. In this paper, we determine the maximum size of $P_{2,2}$-free digraphs of order $n$ as well as the extremal digraphs…

Flag codes are multishot network codes consisting of sequences of nested subspaces (flags) of a vector space $\mathbb{F}_q^n$, where $q$ is a prime power and $\mathbb{F}_q$, the finite field of size $q$. In this paper we study the…

In this paper we study a class of multishot network codes given by families of nested subspaces (flags) of a vector space $\mathbb{F}_q^n$, being $q$ a prime power and $\mathbb{F}_q$ the finite field of $q$ elements. In particular, we focus…