Perfect codes in direct products of cycles—a complete characterization
Author:
- 1 August 2008
- journal article
- Published by Elsevier in Advances in Applied Mathematics
- Vol. 41 (2) , 197-205
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- An almost complete description of perfect codes in direct products of cyclesAdvances in Applied Mathematics, 2006
- Characterizing r-perfect codes in direct products of two and three cyclesInformation Processing Letters, 2005
- Perfect r-domination in the Kronecker product of two cycles, with an application to diagonal/toroidal meshInformation Processing Letters, 2003
- 1-perfect codes in Sierpiński graphsBulletin of the Australian Mathematical Society, 2002
- Perfect r-domination in the Kronecker product of three cyclesIEEE Transactions on Circuits and Systems I: Regular Papers, 2002
- Error-correcting codes on the towers of Hanoi graphsDiscrete Mathematics, 1999
- Isomorphic components of Kronecker product of bipartite graphsDiscussiones Mathematicae Graph Theory, 1997
- Regular codes in regular graphs are difficultDiscrete Mathematics, 1994
- Perfect codes over graphsJournal of Combinatorial Theory, Series B, 1986
- Perfect codes in graphsJournal of Combinatorial Theory, Series B, 1973