On Tilings of Asymmetric Limited-Magnitude Balls

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

We study whether an asymmetric limited-magnitude ball may tile ℤ^n. This ball generalizes previously studied shapes: crosses, semi-crosses, and quasi-crosses. Such tilings act as perfect error-correcting codes in a channel which changes a transmitted integer vector in a bounded number of entries by limited-magnitude errors. A construction of lattice tilings based on perfect codes in the Hamming metric is given. Several non-existence results are proved, both for general tilings, and lattice tilings. A complete classification of lattice tilings for two certain cases is proved.

READ FULL TEXT
research
05/29/2020

On Lattice Packings and Coverings of Asymmetric Limited-Magnitude Balls

We construct integer error-correcting codes and covering codes for the l...
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
11/03/2020

Nonexistence of perfect permutation codes under the Kendall τ-metric

In the rank modulation scheme for flash memories, permutation codes have...
research
03/04/2019

Asymmetric Single Magnitude Four Error Correcting Codes

Limited magnitude asymmetric error model is well suited for flash memory...
research
05/05/2019

Correcting Codes for Asymmetric Single Magnitude Four Error

An error model with asymmetric single magnitude four error is considered...
research
04/23/2019

Obtaining binary perfect codes out of tilings

A translation-support metric (TS-metric) is a metric which is translatio...
research
05/25/2018

The Error Probability of Generalized Perfect Codes via the Meta-Converse

We introduce a definition of perfect and quasi-perfect codes for symmetr...

Please sign up or login with your details

Forgot password? Click here to reset