Abstract
Let \(n, m \ge 2\) be integers. The cartesian, categorical and lexicographic products of m copies of the n-cycle denoted by \(C_n\) all have as their vertex-set \(\{0, 1, \ldots , n-1\}^m\), 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 \(C_n\) are examined. Full and partial PD-sets were also found for the various codes.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Harary, F.: Automorphism group of a hypercube. J. Univers. Comput. Sci. 6(1), 136–138 (2000)
Huffman, W.C.: Codes and groups. In: Pless, V.S., Huffman, W.C. (eds.) Handbook of Coding Theory, Part 2, vol. 2, pp. 1345–1440. Elsevier, Amsterdam (1998)
Key, J.D., Seneviratne, P.: Permutation decoding for binary self-dual codes from the graph \(Q_n\) where \(n\) is even. In: Shaska, T., Huffman, W.C., Joyner, D., Ustimenko, V. (eds.) Advances in Coding Theory and Cryptology, Series on Coding Theory and Cryptology, vol. 2. World scientific Publishing Co. Ltd., Hackensack (2007)
Kroll, H.J., Vincenti, R.: PD-sets related to the codes of some classical varieties. Discret. Math. 301, 89–105 (2005)
MacWilliams, F.J.: Permutation decoding of systematic codes. Bell Syst. Tech. J. 43, 485–505 (1964)
MacWilliams, F.J., Sloane, N.J.A.: The Theory of Error-Correcting Codes. North-Holland, Amsterdam (1983)
Sabidussi, G.: Graph Multiplication. Math. Z. 72, 446–452 (1960)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Fish, W. Binary codes and permutation decoding sets from the graph products of cycles. AAECC 28, 369–386 (2017). https://doi.org/10.1007/s00200-016-0310-y
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00200-016-0310-y