Emergent Mind
On the number of $q$-ary quasi-perfect codes with covering radius 2
(2111.00774)
Published Nov 1, 2021
in
cs.IT
and
math.IT
Abstract
In this paper we present a family of $q$-ary nonlinear quasi-perfect codes with covering radius 2. The codes have length $n = qm$ and size $ M = q{n - m - 1}$ where $q$ is a prime power, $q \geq 3$, $m$ is an integer, $m \geq 2$. We prove that there are more than $q{q{cn}}$ nonequivalent such codes of length $n$, for all sufficiently large $n$ and a constant $c = \frac{1}{q} - \varepsilon$.
We're not able to analyze this paper right now due to high demand.
Please check back later (sorry!).
Generate a summary of this paper on our Pro plan:
We ran into a problem analyzing this paper.