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.
Geometric representations of binary codes embeddable in three dimensions
我们说二元线性码C具有几何表示,如果存在二维单纯复形D,使得C是D的关联矩阵的核ker D的删余码,并且dim C = dim ker D。我们证明了每个二进制线性码都有一个可以嵌入到R^4中的几何表示。此外,我们证明了二元线性码C在R^3中有几何表示当且仅当存在图G使得C等于G的割空间。这是一个多项式可测试的属性,因此我们可以得出结论,有一个多项式算法,决定了一个二进制线性码的几何表示的最小维数。
Geometric difference families and related variable-weight geometric orthogonal codes
School of Mathematical Sciences, Hebei Normal University(河北师范大学数学科学学院);College of Basic Education, Beijing Institute of Economics and Management(北京经济管理职业学院基础教育部);Hebei Research Center of the Basic Discipline Pure Mathematics(河北省基础学科纯数学研究中心)
Geometric construction of k-optimal locally repairable codes
Hebei Normal University(河北师范大学);Hebei Research Center of the Basic Discipline Pure Mathematics(河北省基础学科数学研究中心);Hebei Key Laboratory of Computational Mathematics and Applications(河北省计算数学与应用重点实验室)