Laplacian Simplices II: A Coding Theoretic Approach

MaRDI QIDQ6306444zbMATH OpenFDO

Authors Marie E. Meyer, Tefjol Pllaha

Publication date 9 September 2018

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Lattice polytopes in convex geometry (including relations with commutative algebra and algebraic geometry) (52B20) Linear codes (general theory) (94B05)

Abstract: This paper further investigates emph{Laplacian simplices}. A construction by Braun and the first author associates to a simple connected graph $G$ a simplex $c{P}_G$ whose vertices are the rows of the Laplacian matrix of $G$. In this paper we associate to a reflexive $c{P}_G$ a duality-preserving linear code $cC(c{P}_G)$. This new perspective allows us to build upon previous results relating graphical properties of $G$ to properties of the polytope $c{P}_G$. In particular, we make progress towards a graphical characterization of reflexive $c{P}_G$ using techniques from Ehrhart theory. We provide a systematic investigation of $cC(c{P}_G)$ for cycles, complete graphs, and graphs with a prime number of vertices. We construct an asymptotically good family of MDS codes. In addition, we show that any rational rate is achievable by such construction.

This page was built for publication: Laplacian Simplices II: A Coding Theoretic Approach

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6306444)