Codes correcting restricted errors

Abstract: We study the largest possible length

B

of

(B - 1)

-dimensional linear codes over

m a t h b b F_{q}

which can correct up to

t

errors taken from a restricted set

m a t h c a l A s u b s e t e q m a t h b b 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

e l l

th roots of unity, where

e l l

is a prime divisor of

p - 1

, define good such codes.

Recommendations

Cites work

Cited in

(6)

This page was built for publication: Codes correcting restricted errors