Related papers: On the distance between linear codes

It is easy to see that in a connected graph any 2 longest paths have a vertex in common. For k>=7, Skupien in [7] obtained a connected graph in which some k longest paths have no common vertex, but every k-1 longest paths have a common…

Let $G$ be an edge-colored connected graph. A path $P$ in $G$ is called a distance $\ell$-proper path if no two edges of the same color appear with fewer than $\ell$ edges in between on $P$. The graph $G$ is called $(k,\ell)$-proper…

The power graph $\Gamma_G$ of a finite group $G$ is the graph with the vertex set $G$, where two distinct elements are adjacent if one is a power of the other. An $L(2, 1)$-labeling of a graph $\Gamma$ is an assignment of labels from…

The Steiner distance of a graph, introduced by Chartrand, Oellermann, Tian and Zou in 1989, is a natural generalization of the concept of classical graph distance. For a connected graph $G$ of order at least $2$ and $S\subseteq V(G)$, the…

Given a finite group $G$, denote by $\Gamma(G)$ the simple undirected graph whose vertices are the distinct sizes of noncentral conjugacy classes of $G$, and set two vertices of $\Gamma(G)$ to be adjacent if and only if they are not coprime…

We consider $q$-ary (linear and nonlinear) block codes with exactly two distances: $d$ and $d+\delta$. Several combinatorial constructions of optimal such codes are given. In the linear (but not necessary projective) case, we prove that…

It is reasonable to expect the theory of quantum codes to be simplified in the case of codes of minimum distance 2; thus, it makes sense to examine such codes in the hopes that techniques that prove effective there will generalize. With…

For a group $G,$ the generating graph of $G,$ denoted by $\Gamma(G).$ We define $Q_n=\langle x,y: x^{2n}=y^4=1, x^n=y^2,y^{-1}xy=x^{-1}\rangle,$ the dicyclic group of order $4n.$ This paper primarily delves into exploring the graph…

Denote by $\mathbb G(k,n)$ the Grassmannian of linear subspaces of dimension $k$ in $\mathbb P^n$. We show that if $n>m$ then every morphism $\varphi: \mathbb G(k,n) \to \mathbb G(l,m)$ is constant.

Let $\Omega_q=\Omega_q(H)$ denote the set of proper $[q]$-colorings of the hypergraph $H$. Let $\Gamma_q$ be the graph with vertex set $\Omega_q$ and an edge ${\sigma,\tau\}$ where $\sigma,\tau$ are colorings iff $h(\sigma,\tau)=1$. Here…

Let $n$ be a positive integer, $q$ be a prime power, and $V$ be a vector space of dimension $n$ over $\mathbb{F}_q$. Let $G := V \rtimes G_0$, where $G_0$ is an irreducible subgroup of ${\rm GL}(V)$ which is maximal by inclusion with…

Generating functions for the size of a $r$-sphere, with respect to the Manhattan distance in an $n$-dimensional grid, are used to provide explicit formulas for the minimum and maximum size of an $r$-ball centered at a point of the grid.…

If a regular graph of degree $k$ and diameter $d$ has $v$ vertices then $$v\le 1+k+k(k-1)+\dots+k(k-1)^{d-1}.$$ Graphs with $v=1+k+k(k-1)+\dots+k(k-1)^{d-1}$ are called Moore graphs. Damerell proved that a Moore graph of degree $k\ge 3$ has…

We consider a 2-homogeneous bipartite distance-regular graph $\Gamma$ with diameter $D \geq 3$. We assume that $\Gamma$ is not a hypercube nor a cycle. We fix a $Q$-polynomial ordering of the primitive idempotents of $\Gamma$. This…

We consider a new class of linear codes, called affine Grassmann codes. These can be viewed as a variant of generalized Reed-Muller codes and are closely related to Grassmann codes. We determine the length, dimension, and the minimum…

For an undirected graph G=(V,E), a vertex x \in V separates vertices u and v (where u,v \in V, u \neq v) if their distances to x are not equal. Given an integer parameter k \geq 1, a set of vertices L \subseteq V is a feasible solution if…

Let $\mathbb{F}_q$ denote a finite field with $q$ elements. Let $n,k$ denote integers with $n>2k\geq 6$. Let $V$ denote a vector space over $\mathbb{F}_{q}$ that has dimension $n$. The vertex set of the Grassmann graph $J_q(n,k)$ consists…

The Gilbert graph $\text{Gilbert}(q,n,d)$, which arises naturally in graph theory and coding theory, is the regular graph on $\mathbb{F}_q^n$ in which two vertices are adjacent if their Hamming distance is less than $d$, and it is…

In this paper we consider a two-parameter family {dGWp,q}p,q of Gromov- Wasserstein distances between metric measure spaces. By exploiting a suitable interaction between specific values of the parameters p and q and the metric of the…

Let $G=(V,E)$ be a graph and $\Gamma $ an Abelian group both of order $n$. A $\Gamma$-distance magic labeling of $G$ is a bijection $\ell \colon V\rightarrow \Gamma $ for which there exists $\mu \in \Gamma $ such that $% \sum_{x\in…