English

Covering sets for limited-magnitude errors

Information Theory 2013-10-02 v1 math.IT Number Theory

Abstract

For a set \cM={μ,μ+1,,λ}{0}\cM=\{-\mu,-\mu+1,\ldots, \lambda\}\setminus\{0\} with non-negative integers λ,μ<q\lambda,\mu<q not both 0, a subset \cS\cS of the residue class ring Zq\Z_q modulo an integer q1q\ge 1 is called a (λ,μ;q)(\lambda,\mu;q)-\emph{covering set} if \cM\cS={msmodq:m\cM, s\cS}=Zq. \cM \cS=\{ms \bmod q : m\in \cM,\ s\in \cS\}=\Z_q. Small covering sets play an important role in codes correcting limited-magnitude errors. We give an explicit construction of a (λ,μ;q)(\lambda,\mu;q)-covering set \cS\cS which is of the size q1+o(1)max{λ,μ}1/2q^{1 + o(1)}\max\{\lambda,\mu\}^{-1/2} for almost all integers q1q\ge 1 and of optimal size pmax{λ,μ}1p\max\{\lambda,\mu\}^{-1} if q=pq=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)max{λ,μ}1/2,\omega_{\lambda,\mu}(q)\le q^{1+o(1)}\max\{\lambda,\mu\}^{-1/2}, for any integer q1q\ge 1, 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}
}
R2 v1 2026-06-22T01:37:42.053Z