$2$-quasi-perfect Lee codes and abelian Ramanujan graphs: a new construction and relationship
Information Theory
2026-04-23 v3 Combinatorics
math.IT
Abstract
This paper presents a new explicit infinite family of 2-quasi-perfect -ary Lee codes of length and dimension for , a prime. Our codes are derived from the generating set of the additive group of the finite field . Furthermore, we bridge between 2-quasi-perfect Lee codes constructed by Mesnager, Tang, and Qi and well-known abelian Ramanujan graphs, specifically Li's graphs and finite Euclidean graphs, providing a unified theoretical framework for these families.
Cite
@article{arxiv.2601.12393,
title = {$2$-quasi-perfect Lee codes and abelian Ramanujan graphs: a new construction and relationship},
author = {Shohei Satake},
journal= {arXiv preprint arXiv:2601.12393},
year = {2026}
}
Comments
10 pages. A remark on Lemma 13 and reference [5] have been added. Comments are welcome