@article{Article_47,

title = {Graph Metric Codes of Minimum Distance 3},

journal = {Communications in Combinatorics, Cryptography & Computer Science},

volume = {2022},

issue = {2},

issn = { 2783-5456 },

year = {2022},

url = {http://cccs.sgh.ac.ir/Articles/2022/issue 2/2-11-GraphMetricCodesofMinimumDistance3.pdf},

author = {Mehri Oghbaei and Zahra Hadizadeh and Amirreza Akbari and and Javad B. Ebrahimi},

keywords = {Graph metric codes, Error correcting codes, Lee metric codes, Graph, Maximum fractional forcing number.},

abstract = {In this work, we introduce the notion of graph metric codes. In these codes, the code alphabet is the set of the vertices of a fixed graph G, the codewords are vectors over V(G) and the distance of two vectors is defined as the summation of the graph distances of the corresponding entries. Then, we present a code construction with the minimum distance of 3. To the best of our knowledge, for the particular case of G=K_2, our result gives the best known lower bound for the size of minimum distance 3 codes, when the length of the vectors is large enough. Finally, we present an application of these codes in the context of the innate degree of freedom of Kekule structures in organic chemistry.}

};