arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2201.08464math.AGcs.ITmath.IT
收藏

论好的无穷Toric码族或其缺失

On Good Infinite Families of Toric Codes or the Lack Thereof

Mallory Dolorfino, Cordelia Horch, Kelly Jabbusch, Ryan Martinez

AI总结:

本文研究Toric码的无穷族,通过多胞体运算构造,给出不存在信息率和相对最小距离均不趋于0的好码族的条件与证据。

摘要:

Toric码由Hansen引入,作为$\mathbb{F}_q^n$的$k$维子空间,用以扩展Reed-Solomon码,其由Toric簇或其关联的积分凸多胞体$P \subseteq [0,q-2]^n$决定,其中$k=|P \cap \mathbb{Z}^n|$(即$P$的整数格点数)。决定码质量的有两个相关参数:信息率,衡量每个码字单个比特所包含的信息量;以及相对最小距离,衡量相对于每个码字的比特数能纠正多少错误。Soprunov和Soprunova定义好的无穷码族为多胞体维数无界的一系列码,使得相应的信息率和相对最小距离在极限中均不趋于0。我们通过考虑多胞体运算如联合(join)和直和(direct sum)来研究构造码族的不同方式。在此过程中,我们给出了不存在好族(good family)的条件,并提供了强有力的证据表明不存在这样的好码族。

英文摘要:

A toric code, introduced by Hansen to extend the Reed-Solomon code as a $k$-dimensional subspace of $\mathbb{F}_q^n$, is determined by a toric variety or its associated integral convex polytope $P \subseteq [0,q-2]^n$, where $k=|P \cap \mathbb{Z}^n|$ (the number of integer lattice points of $P$). There are two relevant parameters that determine the quality of a code: the information rate, which measures how much information is contained in a single bit of each codeword; and the relative minimum distance, which measures how many errors can be corrected relative to how many bits each codeword has. Soprunov and Soprunova defined a good infinite family of codes to be a sequence of codes of unbounded polytope dimension such that neither the corresponding information rates nor relative minimum distances go to 0 in the limit. We examine different ways of constructing families of codes by considering polytope operations such as the join and direct sum. In doing so, we give conditions under which no good family can exist and strong evidence that there is no such good family of codes.

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

↑