arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1310.0120cs.ITmath.ITmath.NT
收藏

有限幅值误差的覆盖集

Covering sets for limited-magnitude errors

Zhixiong Chen, Igor E. Shparlinski, Arne Winterhof

摘要:

对于一个集合$\cM=\{-μ,-μ+1,\ldots, λ\}\setminus\{0\}$,其中非负整数$λ,μ<q$不都为0,剩余类环$\Z_q$模整数$q\ge 1$的子集$\cS$称为$(λ,μ;q)$,如果$$ \cM \cS=\{ms \bmod q : m\in \cM,\ s\in \cS\}=\Z_q. $$小覆盖集在纠正有限大小错误的码中起重要作用。给出了一个$(λ,μ;q)$ -覆盖集$\cS$的显式构造,它对几乎所有的整数$q\ge 1$都具有$q^{1 + o(1)}\max\{λ,μ\}^{-1/2}$的大小,并且当$q=p$是素数时具有最佳大小$p\max\{λ,μ\}^{-1}$.利用Cochrane和Shi关于特征和的四阶矩的一个界,证明了对任意整数$q\ge 1$,特征和的四阶矩的界$$ω_{λ,μ}(q)\le q^{1+o(1)}\max\{λ,μ\}^{-1/2},$$,但该界的证明不是构造性的.

英文摘要:

For a set $\cM=\{-μ,-μ+1,\ldots, λ\}\setminus\{0\}$ with non-negative integers $λ,μ<q$ not both 0, a subset $\cS$ of the residue class ring $\Z_q$ modulo an integer $q\ge 1$ is called a $(λ,μ;q)$-\emph{covering set} if $$ \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)$-covering set $\cS$ which is of the size $q^{1 + o(1)}\max\{λ,μ\}^{-1/2}$ for almost all integers $q\ge 1$ and of optimal size $p\max\{λ,μ\}^{-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)\le q^{1+o(1)}\max\{λ,μ\}^{-1/2},$$ for any integer $q\ge 1$, however the proof of this bound is not constructive.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑