On Lattice Packings and Coverings of Asymmetric Limited-Magnitude Balls

DOI10.1109/TIT.2021.3070462MaRDI QIDQ4958211zbMATH OpenOpenAlexFDO

Authors Hengjia Wei, Xin Wang, Moshe Schwartz

Publication date 7 September 2021

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

Full work available at URL https://arxiv.org/abs/2005.14519

zbMATH Keywords

covering codesinteger error-correcting codeslimited-magnitude error channel

Mathematics Subject Classification ID

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

Abstract: We construct integer error-correcting codes and covering codes for the limited-magnitude error channel with more than one error. The codes are lattices that pack or cover the space with the appropriate error ball. Some of the constructions attain an asymptotic packing/covering density that is constant. The results are obtained via various methods, including the use of codes in the Hamming metric, modular $B_t$-sequences, $2$-fold Sidon sets, and sets avoiding arithmetic progression.

Cited in

(3)

• On tilings of asymmetric limited-magnitude balls
• Lattice packing of nearly-euclidean balls in spaces of even dimension
• On lattice tilings of \(\mathbb{Z}^n\) by limited-magnitude error balls \(\mathcal{B}(n, 2, k_1, k_2)\) with \(k_1 > k_2\)

This page was built for publication: On Lattice Packings and Coverings of Asymmetric Limited-Magnitude Balls

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