小多边形和复曲面代码
Small polygons and toric codes
摘要:
我们描述了两种不同的方法,使系统分类的平面点阵多边形,并恢复他们产生的复曲面代码,在小字段,这些匹配或超过最佳已知的最小距离。这包括F_7上的[36,19,12]-码,其最小距离12超过所有先前已知的码的最小距离。
英文摘要:
We describe two different approaches to making systematic classifications of plane lattice polygons, and recover the toric codes they generate, over small fields, where these match or exceed the best known minimum distance. This includes a [36,19,12]-code over F_7 whose minimum distance 12 exceeds that of all previously known codes.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。