On almost perfect linear Lee codes of packing radius 2

DOI10.1109/TIT.2023.3287222MaRDI QIDQ6574964zbMATH OpenFDO

Authors Xiaodong Xu, Yue Zhou

Publication date 19 July 2024

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/TIT.2023.3287222

zbMATH Keywords

classification of linear Lee codesGolomb-Welch conjecturepacking density

Mathematics Subject Classification ID

Combinatorial codes (94B25) Applications of the theory of convex sets and geometry of numbers (covering radius, etc.) to coding theory (94B75)

Cited in

(2)

• On lattice constructions D and D^ from q-ary linear codes
• On the packing density of Lee spheres

This page was built for publication: On almost perfect linear Lee codes of packing radius 2

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6574964)