Binary codes and permutation decoding sets from the graph products of cycles

摘要

Let be integers. The cartesian, categorical and lexicographic products of m copies of the n-cycle denoted by all have as their vertex-set , with adjacency defined variously. In this paper the binary codes generated by the row span of adjacency matrices of the cartesian, categorical and lexicographic products of m copies of are examined. Full and partial PD-sets were also found for the various codes.