Covering sets for limited-magnitude errors
Abstract
For a set =\-μ,-μ+1,…, λ\\0\ with non-negative integers λ,μ<q not both 0, a subset of the residue class ring q modulo an integer q 1 is called a (λ,μ;q)-covering set if =\ms q : m∈ ,\ s∈ \=q. Small covering sets play an important role in codes correcting limited-magnitude errors. We give an explicit construction of a (λ,μ;q)-covering set which is of the size q1 + o(1)\λ,μ\-1/2 for almost all integers q 1 and of optimal size p\λ,μ\-1 if q=p is prime. Furthermore, using a bound on the fourth moment of character sums of Cochrane and Shi we prove the bound ωλ,μ(q) q1+o(1)\λ,μ\-1/2, for any integer q 1, however the proof of this bound is not constructive.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.