2021/11/01 by Alexander M. Romanov, Romanov, Alexander M.
Computer Science · Engineering · Mathematics · Medicine · #Cancer Mechanisms and Therapy #Coding theory and cryptography #FOS: Computer and information sciences #Information Theory (cs.IT) #cs.IT #graph theory and CDMA systems #math.IT
paper · pdf · doi:10.48550/arxiv.2111.00774
arxiv created 2021/11/01 · openalex publication_date 2021/11/01 · arxiv updated 2021/11/02 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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 = qn - m - 1 where q is a prime power, q ≥ 3, m is an integer, m ≥ 2. We prove that there are more than q^qcn nonequivalent such codes of length n, for all sufficiently large n and a constant c = (1)/(q) - ε.