相关论文: Perfect Mannheim, Lipschitz and Hurwitz weight cod…
Several recent papers have considered the problem of how large a subset of integers can be without containing any 3-term geometric progressions. This problem has also recently been generalized to rings of integers in quadratic number fields…
In this paper, cyclic codes are established over some finite quaternion integer rings with respect to the quaternion Mannheim distance, and de- coding algorithm for these codes is given.
We are motivated by cone spherical metrics on compact Riemann surfaces of positive genus to solve a special case of the Hurwitz problem. Precisely speaking, letting $d,\,g$ and $\ell$ be three positive integers and $\Lambda$ be the…
Let $p$ be a prime number, $q=p^s$ for a positive integer $s$. For any positive divisor $e$ of $q-1$, we construct an infinite family codes of size $q^{2m}$ with few Lee-weight. These codes are defined as trace codes over the ring…
Upper bounds on the minimum Lee distance of codes that are linear over ${\mathbb Z}_q$, $q=p^t$, $p$ prime are discussed. The bounds are Singleton like, depending on the length, rank, and alphabet size of the code. Codes meeting such bounds…
In this paper, we introduce new general frameworks for estimating the maximal dimension of Hilbert cubes contained in finite truncations of arbitrary sets. As applications, we investigate Hilbert cubes in a range of arithmetic sets,…
A tiling of the $n$-dimensional Hamming cube gives rise to a perfect code (according to a given metric) if the basic tile is a metric ball. We are concerned with metrics on the $n$-dimensional Hamming cube which are determined by a weight…
Few-weight codes have been constructed and studied for many years, since their fascinating relations to finite geometries, strongly regular graphs and Boolean functions. Simplex codes are one-weight Griesmer $[\frac{q^k-1}{q-1},k…
We study the fractional Hardy inequality on the integer lattice. We prove null-criticality of the Hardy weight and hence optimality of the constant. More specifically, we present a family of Hardy weights with respect to a parameter and…
A systematic way of constructing Grassmannian codes endowed with the subspace distance as lifts of matrix codes over the prime field $GF(p)$ is introduced. The matrix codes are $GF(p)$-subspaces of the ring $M_2(GF(p))$ of $2 \times 2$…
We prove that the Lipschitz-free space over a countable proper metric space is isometric to a dual space and has the metric approximation property. We also show that the Lipschitz-free space over a proper ultrametric space is isometric to…
The generalized Hamming weights (GHWs) are fundamental parameters of linear codes. In this paper, we investigate the generalized Hamming weights of two classes of linear codes constructed from defining sets and determine them completely…
We consider codes over $\mathbb{Z}_{p^s}$ with the extended Lee weight. We find Singleton bounds with respect to this weight and define MLDS and MLDR codes accordingly. We also consider the kernels of these codes and the notion of…
In this paper we introduce and study line Hermitian Grassmann codes as those subcodes of the Grassmann codes associated to the $2$-Grassmannian of a Hermitian polar space defined over a finite field of square order. In particular, we…
Extended $1$-perfect codes in the Hamming scheme $H(n,q)$ can be equivalently defined as codes that turn to $1$-perfect codes after puncturing in any coordinate, as completely regular codes with certain intersection array, as uniformly…
Two-weight linear codes are linear codes in which any nonzero codeword can have only two possible distinct weights. Those in the Hamming metric have proven to be very interesting for their connections with authentication codes, association…
The generalized Hamming weights of a linear code have been extensively studied since Wei first use them to characterize the cryptography performance of a linear code over the wire-tap channel of type II. In this paper, we investigate the…
Some mutually quasi-unbiased weighing matrices are constructed from binary codes satisfying certain conditions. Motivated by this, in this note, we study binary codes satisfying the conditions. The weight distributions of binary codes…
A lower bound on the number of uncorrectable errors of weight half the minimum distance is derived for binary linear codes satisfying some condition. The condition is satisfied by some primitive BCH codes, extended primitive BCH codes,…
Upper bounds on the maximum number of codewords in a binary code of a given length and minimum Hamming distance are considered. New bounds are derived by a combination of linear programming and counting arguments. Some of these bounds…