Generalized graph codes and thier minimum distances

Graph code is a linear code obtained from linear codes $C$ and a certain bipartite graph G. In this paper, I propose an expansion of the definition of graph code to general $l$-partite, and give its lower bound of minimum distance. I also give an example of generalized graph code and calculate its parameters $[n,k,d]$.