Shannon界附近的构造性球码
Constructive spherical codes near the Shannon bound
摘要:
香农在1959年给出了一个下界的二进制率球码的最小欧氏距离$ρ$。使用非建设性的代码在一个有限的字母表,我们给出了一个较弱的下限,但非常接近小值的$ρ$。该结构是基于Yaglom映射结合一些有限球填充从非建设性代码的欧几里德度量。将满足TVZ约束的几何码与$GF(p),$上的Lee度量BCH码相连接,我们得到了多项式时间可构造的球形码。他们的参数优于Lachaud和Stern在1994年获得的。在非常高的速率下,它们超过香农界限的98%。
英文摘要:
Shannon gave a lower bound in 1959 on the binary rate of spherical codes of given minimum Euclidean distance $ρ$. Using nonconstructive codes over a finite alphabet, we give a lower bound that is weaker but very close for small values of $ρ$. The construction is based on the Yaglom map combined with some finite sphere packings obtained from nonconstructive codes for the Euclidean metric. Concatenating geometric codes meeting the TVZ bound with a Lee metric BCH code over $GF(p),$ we obtain spherical codes that are polynomial time constructible. Their parameters outperform those obtained by Lachaud and Stern in 1994. At very high rate they are above 98 per cent of the Shannon bound.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。