Related papers: On the distance between linear codes

We study a distance graph $\Gamma_n$ that is isomorphic to the $1$-skeleton of an $n$-dimensional unit hypercube. We show that every measurable set of positive upper Banach density in the plane contains all sufficiently large dilates of…

We consider linear error correcting codes associated to higher dimensional projective varieties defined over a finite field. The problem of determining the basic parameters of such codes often leads to some interesting and difficult…

The diameter of a graph is the maximum distance among all pairs of vertices. Thus a graph $G$ has diameter $d$ if any two vertices are at distance at most $d$ and there are two vertices at distance $d$. We are interested in studying the…

Let $\mathbb{F}_q$ be a finite field with $q=p^{e}$ elements, where $p$ is a prime number and $e \geq 1$ is an integer. In this paper, by means of generalized Reed-Solomon (GRS) codes, we construct two new classes of quantum…

We show that large subsets of vector spaces over finite fields determine certain point configurations with prescribed distance structure. More specifically, we consider the complete graph with vertices as the points of $A \subseteq…

Let $S$ be an $n$-dimensional vector space over the finite field $\mathbb{F}_q$, where $q$ is necessarily a prime power. Denote $K_q(n,k)$ (resp. $J_q(n,k)$) to be the \emph{$q$-Kneser graph} (resp. \emph{Grassmann graph}) for $k\geq 1$…

Let $G$ be a graph with vertex set $V(G)$. For any two distinct vertices $x$ and $y$ of $G$, let $R\{x, y\}$ denote the set of vertices $z$ such that the distance from $x$ to $z$ is not equal to the distance from $y$ to $z$ in $G$. For a…

An $L(2,1)$-labelling of a finite graph $\Gamma$ is a function that assigns integer values to the vertices $V(\Gamma)$ of $\Gamma$ (colouring of $V(\Gamma)$ by ${\mathbb{Z}}$) so that the absolute difference of two such values is at least…

We give a new asymptotic upper bound on the size of a code in the Grassmannian space. The bound is better than the upper bounds known previously in the entire range of distances except very large values.

We investigate locally $n \times n$ grid graphs, that is, graphs in which the neighbourhood of any vertex is the Cartesian product of two complete graphs on $n$ vertices. We consider the subclass of these graphs for which each pair of…

A $\Gamma$-distance magic labeling of a graph $G=(V,E)$ with $|V | = n$ is a bijection $f$ from $V$ to an Abelian group $\Gamma$ of order $n$ such that the weight $w(x)=\sum_{y\in N_G(x)}f(y)$ of every vertex $x \in V$ is equal to the same…

Let $\Gamma$ denote a bipartite graph with vertex set $X$, color partitions $Y$, $Y'$, and assume that every vertex in $Y$ has eccentricity $D\ge 3$. For $z\in X$ and a non-negative integer $i$, let $\Gamma_{i}(z)$ denote the set of…

For $d\ge 2$ and an odd prime power $q$, consider the vector space $\mathbb{F}_q^d$ over the finite field $\mathbb{F}_q$, where the distance between two points $(x_1,\ldots,x_d)$ and $(y_1,\ldots,y_d)$ is defined as $\sum_{i=1}^d…

In this paper, we consider the unit graph $G(\mathbb{Z}_{n})$, where $n=p_{1}^{n_{1}} \text{ or } p_{1}^{n_{1}}p_{2}^{n_{2}} \text{ or } p_{1}^{n_{1}}p_{2}^{n_{2}}p_{3}^{n_{3}}$ and $p_{1}, p_{2}, p_{3}$ are distinct primes. For any prime…

Let $\Gamma$ denote a distance-regular graph with classical parameters $(D, b, \alpha, \beta)$ and $D\geq 3$. Assume the intersection numbers $a_1=0$ and $a_2\not=0$. We show $\Gamma$ is 3-bounded in the sense of the article [D-bounded…

A sequence of geometric random variables of length $n$ is a sequence of $n$ independent and identically distributed geometric random variables ($\Gamma_1, \Gamma_2, \dots, \Gamma_n$) where $\mathbb{P}(\Gamma_j=i)=pq^{i-1}$ for…

The classical (vertex) metric dimension of a graph G is defined as the cardinality of a smallest set S in V (G) such that any two vertices x and y from G have different distances to least one vertex from S: The k-metric dimension is a…

Let $k \subset K$ be an extension of fields, and let $A \subset M_{n}(K)$ be a $k$-algebra. We study parameter spaces of $m$-dimensional subspaces of $K^{n}$ which are invariant under $A$. The space $\mathbb{F}_{A}(m,n)$, whose $R$-rational…

Let $p$ be a prime and let $q$ be a power of $p$. In this paper, by using generalized Reed-Solomon (GRS for short) codes and extended GRS codes, we construct two new classes of quantum maximum-distance- separable (MDS) codes with parameters…

We introduce the notion of Levenshtein graphs, an analog to Hamming graphs but using the edit distance instead of the Hamming distance; in particular, Levenshtein graphs allow for underlying strings (nodes) of different lengths. We…