The 2-distance coloring of the Cartesian product of cycles using optimal Lee codes

► We study the 2-distance coloring of the Cartesian product of cycles. ► This is the first paper to use Lee codes from Coding Theory in this coloring. ► We consider the Cartesian product of three cycles of lengths up to 9. ► We compute the exact values of the 2-distance coloring of this product.