Codes correcting restricted errors

11/08/2018

∙

by   Igor E. Shparlinski, et al.

∙

0

∙

share

We study the largest possible length B of (B-1)-dimensional linear codes over F_q which can correct up to t errors taken from a restricted set A⊆F_q^*. Such codes can be applied to multilevel flash memories. Moreover, in the case that q=p is a prime and the errors are limited by a constant we show that often the primitive ℓth roots of unity, where ℓ is a prime divisor of p-1, define good such codes.