Mathematics – Combinatorics
Scientific paper
2010-08-17
Mathematics
Combinatorics
20 pages, 8 figures, v3 major changes
Scientific paper
We say that a linear code C over a field F is triangular representable if there exists a two dimensional simplicial complex $\Delta$ such that C is a punctured code of the kernel ker $\Delta$ of the incidence matrix of $\Delta$ over F and there is a linear mapping between C and ker $\Delta$ 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.
No associations
LandOfFree
Geometric representations of linear codes does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Geometric representations of linear codes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Geometric representations of linear codes will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-398110