Related papers: On the Covering Radius of Some Modular Codes
In this paper, we consider the problem of covering a plane region with unit discs. We present an improved upper bound and the first nontrivial lower bound on the number of discs needed for such a covering, depending on the area and…
In this article we revisit some classical conjectures in harmonic analysis in the setting of mixed norm spaces $L^p_{rad} L^2_{ang} (\mathbb{R}^n)$. We produce sharp bounds for the restriction of the Fourier transform to compact…
We analyze the topology and geometry of a polyhedron of dimension 2 according to the minimum size of a cover by PL collapsible polyhedra. We provide partial characterizations of the polyhedra of dimension 2 that can be decomposed as the…
In this paper, we derive a Singleton bound for lattice schemes and obtain Singleton bounds known for binary codes and subspace codes as special cases. It is shown that the modular structure affects the strength of the Singleton bound. We…
In this paper, we define a new concept of numerical range $W_{o}(\cdot)$ and prove its basic results. We also define the numerical radius $\omega_{o}(\cdot)$ and prove that $$\omega_{o}(T)\leq||| T|||\leq 2\omega_{o}(T).$$
In an error-correcting code, a sender encodes a message $x \in \{ 0, 1 \}^k$ such that it is still decodable by a receiver on the other end of a noisy channel. In the setting of \emph{error-correcting codes with feedback}, after sending…
There are two variants of superposition coding schemes. Cover's original superposition coding scheme has code clouds of the identical shape, while Bergmans's superposition coding scheme has code clouds of independently generated shapes.…
The matrix completion problem provides a unifying lens through which many fundamental problems in coding theory can be viewed. In this paper, we investigate Locally Recoverable Codes (LRCs) with Maximal Recoverability (MR) and Maximum…
Basic facts and definitions of conformal moduli of rings and quadrilaterals are recalled. Some computational methods are reviewed. For the case of quadrilaterals with polygonal sides, some recent results are given. Some numerical…
Self-dual codes have been studied actively because they are connected with mathematical structures including block designs and lattices and have practical applications in quantum error-correcting codes and secret sharing schemes.…
In this paper, we introduce a new parameter of a code, referred to as the remoteness, which can be viewed as a dual to the covering radius. Indeed, the remoteness is the minimum radius needed for a single ball to cover all codewords. After…
We give a description of the weighted Reed-Muller codes over a prime field in a modular algebra. A description of the homogeneous Reed-Muller codes in the same ambient space is presented for the binary case. A decoding procedure using the…
Given a sphere of any radius $r$ in an $n$-dimensional Euclidean space, we study the coverings of this sphere with solid spheres of radius one. Our goal is to design a covering of the lowest covering density, which defines the average…
In this paper we present a new bound obtained with the probabilistic method for the solution of the Set Covering problem with unit costs. The bound is valid for problems of fixed dimension, thus extending previous similar asymptotic…
For an integer $s\ge 1$, let $\mathcal{C}_s(q_0)$ be the generalized Zetterberg code of length $q_0^s+1$ over the finite field $\F_{q_0}$ of odd characteristic. Recently, Shi, Helleseth, and \"{O}zbudak (IEEE Trans. Inf. Theory 69(11):…
Let $\mathbb{R}^m$ be endowed with the Euclidean metric. The covering radius of a lattice $\Lambda \subset \mathbb{R}^m$ is the least distance $r$ such that, given any point of $\mathbb{R}^m$, the distance from that point to $\Lambda$ is…
We study the covering radii of $2$-transitive permutation groups of Lie rank one, giving bounds and links to finite geometry.
Let $\mathcal{M}_{g,\epsilon}$ be the $\epsilon$-thick part of the moduli space $\mathcal{M}_g$ of closed genus $g$ surfaces. In this article, we show that the number of balls of radius $r$ needed to cover $\mathcal{M}_{g,\epsilon}$ is…
In this paper, we continue the study of small squares containing at least two points on a modular hyperbola $x y \equiv c \pmod{p}$. We deduce a lower bound for its side length. We also investigate what happens if the ``distances" between…
A translation structure equips a Riemann surface with a singular flat metric. Not much is known about the shape of a random translation surface. We compute an upper bound on the expected value of the covering radius of a translation surface…