Parameterized codes over graphs (Q6171842)

The article reviews what is known about the basic parameters of parameterized linear codes over graphs, introduced by \textit{C. Rentería-Márquez} et al. [Finite Fields Appl. 17, No. 1, 81--104 (2011; Zbl 1209.13037)]. In particular, it focuses on the length, dimension, minimum distance and index of regularity. For the length, there is a general formula for any graph, unlike for the dimension, which is, to the knowledge of the authors, only known when the set of evaluation points is a projective torus, or for complete bipartite graphs. For the field of 3 elements, the authors show a new combinatorial formula for the dimension by exploring the connections to Eulerian ideals. With respect to the index of regularity, it is known in several cases, such as when the set of points is a projective torus, or for complete graphs, complete bipartite graphs, etc. Finally, the authors show two particular cases where there is a formula for the minimum distance: when the set of points is a projective torus, and when the graph is a complete bipartite graph.