2-quasi-perfect Lee codes and abelian Ramanujan graphs: a new construction and relationship
Abstract
This paper presents a new explicit infinite family of 2-quasi-perfect p-ary Lee codes of length q-12 and dimension q-12-2k for q = pk 14, p≥ 5 a prime. Our codes are derived from the generating set Hq = \(a, a3) a ∈ Fq*\ of the additive group of the finite field Fq2. 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.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.