On Lattice Packings and Coverings of Asymmetric Limited-Magnitude Balls

05/29/2020
by   Hengjia Wei, et al.
0

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.

READ FULL TEXT
research
05/30/2020

On Tilings of Asymmetric Limited-Magnitude Balls

We study whether an asymmetric limited-magnitude ball may tile ℤ^n. This...
research
05/05/2019

Correcting Codes for Asymmetric Single Magnitude Four Error

An error model with asymmetric single magnitude four error is considered...
research
01/05/2022

Perfect Codes Correcting a Single Burst of Limited-Magnitude Errors

Motivated by applications to DNA-storage, flash memory, and magnetic rec...
research
01/31/2019

On two-fold packings of radius-1 balls in Hamming graphs

A λ-fold r-packing in a Hamming metric space is a code C such that the r...
research
05/24/2022

On the number of error correcting codes

We show that for a fixed q, the number of q-ary t-error correcting codes...
research
08/22/2022

Densities of Codes of Various Linearity Degrees in Translation-Invariant Metric Spaces

We investigate the asymptotic density of error-correcting codes with goo...
research
09/08/2023

Bridging Hamming Distance Spectrum with Coset Cardinality Spectrum for Overlapped Arithmetic Codes

Overlapped arithmetic codes, featured by overlapped intervals, are a var...

Please sign up or login with your details

Forgot password? Click here to reset