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

线性码的几何表示

Geometric representations of linear codes

Pavel Rytíř

摘要:

我们说域F上的线性码C是三角可表示的,如果存在二维单纯复形$Δ$,使得C是F上的$Δ$的关联矩阵的核ker $Δ$的删余码,并且在C和ker $Δ$之间存在线性映射,该线性映射是双射并且将最小码字映射到最小码字。证明了有理数域上和GF(p)上的线性码(其中p是素数)是三角可表示的.在有限域的情况下,我们证明了这个表示决定了C的权枚举数。我们将这个结果应用到Potts模型的分拆函数上。另一方面,我们证明了在任何不同于有理数和GF(p),p素数的域上都存在非三角可表示的线性码。我们表明,三角表示的每一个建设失败的一个非常弱的条件下,一个线性码和它的三角表示必须有相同的尺寸。

英文摘要:

We say that a linear code C over a field F is triangular representable if there exists a two dimensional simplicial complex $Δ$ such that C is a punctured code of the kernel ker $Δ$ of the incidence matrix of $Δ$ over F and there is a linear mapping between C and ker $Δ$ which is a bijection and maps minimal codewords to minimal codewords. We show that the linear codes over rationals and over GF(p), where p is a prime, are triangular representable. In the case of finite fields, we show that this representation determines the weight enumerator of C. We present one application of this result to the partition function of the Potts model. On the other hand, we show that there exist linear codes over any field different from rationals and GF(p), p prime, that are not triangular representable. We show that every construction of triangular representation fails on a very weak condition that a linear code and its triangular representation have to have the same dimension.

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

↑