Covering sets for limited-magnitude errors
Information Theory
2013-10-02 v1 math.IT
Number Theory
Abstract
For a set with non-negative integers not both 0, a subset of the residue class ring modulo an integer is called a -\emph{covering set} if Small covering sets play an important role in codes correcting limited-magnitude errors. We give an explicit construction of a -covering set which is of the size for almost all integers and of optimal size if is prime. Furthermore, using a bound on the fourth moment of character sums of Cochrane and Shi we prove the bound for any integer , however the proof of this bound is not constructive.
Cite
@article{arxiv.1310.0120,
title = {Covering sets for limited-magnitude errors},
author = {Zhixiong Chen and Igor E. Shparlinski and Arne Winterhof},
journal= {arXiv preprint arXiv:1310.0120},
year = {2013}
}