Related papers: On Various Parameters of $Z_q$-Simplex codes for a…
Recently, simplicial complexes are used in constructions of several infinite families of minimal and optimal linear codes by Hyun {\em et al.} Building upon their research, in this paper more linear codes over the ring $\mathbb{Z}_4$ are…
In this work, we study linear codes with the folded Hamming distance, or equivalently, codes with the classical Hamming distance that are linear over a subfield. This includes additive codes. We study MDS codes in this setting and define…
Certain simplicial complexes are used to construct a subset $D$ of $\mathbb{F}_{2^n}^m$ and $D$, in turn, defines the linear code $C_{D}$ over $\mathbb{F}_{2^n}$ that consists of $(v\cdot d)_{d\in D}$ for $v\in \mathbb{F}_{2^n}^m$. Here we…
We investigate the parameterized complexity of the following edge coloring problem motivated by the problem of channel assignment in wireless networks. For an integer q>1 and a graph G, the goal is to find a coloring of the edges of G with…
In this paper we consider a family $\mathcal{F}$ of $16$-dimensional $\mathbb{F}_q$-linear rank metric codes in $\mathbb{F}_q^{8\times8}$, arising from the polynomial $x^{q^s}+\delta x^{q^{4+s}}\in\mathbb{F}_{q^8}[x]$. Examples of MRD codes…
The length function $\ell_q(r,R)$ is the smallest possible length $n$ of a $ q $-ary linear $[n,n-r]_qR$ code with codimension (redundancy) $r$ and covering radius $R$. Let $s_q(N,\rho)$ be the smallest size of a $\rho$-saturating set in…
In this paper, we consider the Reed-Muller (RM) codes. For the first order RM code, we prove that it is unique in the sense that any linear code with the same length, dimension and minimum distance must be the first order RM code; For the…
Let $\mathbb{F}_q$ denote the finite field of order $q,$ $n$ be a positive integer coprime to $q$ and $t \geq 2$ be an integer. In this paper, we enumerate all the complementary-dual cyclic $\mathbb{F}_q$-linear $\mathbb{F}_{q^t}$-codes of…
In this study, some estimates are given for the $ (A,q)$-numerical radius and $ (A,q)$-Crawford number via the $ A$-numerical radius and $ A$-Crawford number for the $ A $-bounded linear operators in any complex semi-Hilbert space,…
We present a formula for the number of line segments connecting q+1 points of an n_1 x...x n_k rectangular grid. As corollaries, we obtain formulas for the number of lines through at least q points and, respectively, through exactly q…
A code $C$ is called $\mathbb{Z}_p\mathbb{Z}_{p^2}$-linear if it is the Gray image of a $\mathbb{Z}_p\mathbb{Z}_{p^2}$-additive code. For any prime number $p$ larger than $3$, the bounds of the rank of $\mathbb{Z}_p\mathbb{Z}_{p^2}$-linear…
A code over GF$(q^m)$ can be imaged or expanded into a code over GF$(q)$ using a basis for the extension field over the base field. The properties of such an image depend on the original code and the basis chosen for imaging. Problems…
Consider the set of all error--correcting block codes over a fixed alphabet with $q$ letters. It determines a recursively enumerable set of points in the unit square with coordinates $(R,\delta)$:= {\it (relative transmission rate, relative…
This paper gives new methods of constructing {\it symmetric self-dual codes} over a finite field $GF(q)$ where $q$ is a power of an odd prime. These methods are motivated by the well-known Pless symmetry codes and quadratic double circulant…
We show that any q-ary code with sufficiently good distance can be randomly punctured to obtain, with high probability, a code that is list decodable up to radius $1 - 1/q - \epsilon$ with near-optimal rate and list sizes. Our results imply…
This paper considers the construction of isodual quasi-cyclic codes. First we prove that two quasi-cyclic codes are permutation equivalent if and only if their constituent codes are equivalent. This gives conditions on the existence of…
Based on good algebraic structures and practicabilities, generalized quasi-cyclic (GQC) codes play important role in coding theory. In this paper, we study some results on GQC codes over $\mathbb{Z}_4$ including the normalized generating…
This paper deals with the problem of increasing the minimum distance of a linear code by adding one or more columns to the generator matrix. Several methods to compute extensions of linear codes are presented. Many codes improving the…
We prove that the class of $\Z_2\Z_2[u]$-linear codes is exactly the class of $\Z_2$-linear codes with automorphism group of even order. Using this characterization, we give examples of known codes, e.g. perfect codes, which has a…
In this paper we generalize constructions in two recent works of Ding, Heng, Zhou to any field $\mathbb{F}_q$, $q$ odd, providing infinite families of minimal codes for which the Ashikhmin-Barg bound does not hold.