Perfect Codes Correcting a Single Burst of Limited-Magnitude Errors

01/05/2022
by   Hengjia Wei, et al.
0

Motivated by applications to DNA-storage, flash memory, and magnetic recording, we study perfect burst-correcting codes for the limited-magnitude error channel. These codes are lattices that tile the integer grid with the appropriate error ball. We construct two classes of such perfect codes correcting a single burst of length 2 for (1,0)-limited-magnitude errors, both for cyclic and non-cyclic bursts. We also present a generic construction that requires a primitive element in a finite field with specific properties. We then show that in various parameter regimes such primitive elements exist, and hence, infinitely many perfect burst-correcting codes exist.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/01/2017

A generalized concatenation construction for q-ary 1-perfect codes

We consider perfect 1-error correcting codes over a finite field with q ...
research
05/30/2020

On Tilings of Asymmetric Limited-Magnitude Balls

We study whether an asymmetric limited-magnitude ball may tile ℤ^n. This...
research
12/27/2021

Quantum codes constructed from cyclic codes over the ring 𝔽_q+v𝔽_q+v^2𝔽_q+v^3𝔽_q+v^4𝔽_q

In this article, we investigate properties of cyclic codes over a finite...
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
08/22/2021

Sequence Reconstruction for Limited-Magnitude Errors

Motivated by applications to DNA storage, we study reconstruction and li...
research
10/21/2022

Non-binary Codes for Correcting a Burst of at Most t Deletions

The problem of correcting deletions has received significant attention, ...
research
11/08/2018

Codes correcting restricted errors

We study the largest possible length B of (B-1)-dimensional linear codes...

Please sign up or login with your details

Forgot password? Click here to reset