Hostname: page-component-cd9895bd7-jn8rn Total loading time: 0 Render date: 2025-01-03T18:54:35.633Z Has data issue: false hasContentIssue false
  • English
  • Français

Perfect codes on the towers of Hanoi graph

Published online by Cambridge University Press:  17 April 2009

Chi-Kwong Li  and
Ingrid Nelson
Chi-Kwong Li
Affiliation:
Department of MathematicsThe College of William and Mary, WilliamsburgVA 23187United States of America, e-mail: [email protected]
Ingrid Nelson
Affiliation:
Lockheed Martin Federal Systems6304 Spine RoadBoulder CO 80302United States of America, e-mail: [email protected]
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

We characterise all the perfect k-error correcting codes that can be defined on the graph associated with the Towers of Hanoi puzzle. In particular, a short proof for the existence of 1-error correcting code on such a graph is given.

Type
Research Article
Information
Bulletin of the Australian Mathematical Society , Volume 57 , Issue 3 , June 1998 , pp. 367 - 376
Copyright
Copyright © Australian Mathematical Society 1998

References

[1]Brualdi, R.A., Introductory combinatorics (North-Holland, New York, 1992).Google Scholar
[2]Cull, P. and Nelson, I., ‘Error-correcting codes on the Towers of Hanoi graphs’, (preprint).Google Scholar
[3]Er, M.C., ‘The cyclic towers of Hanoi and pseudo ternary codes’, J. Inform. Optim. Sci. 6 (1986), 271–277.Google Scholar
[4]Hill, R., A first course in coding theory (Oxford University Press, Oxford, 1986).Google Scholar
[5]Hinz, A.M., ‘The Tower of Hanoi’, Enseign. Math. 35 (1989), 289–321.Google Scholar
[6]Scorer, R.S., Grundy, P.M. and Smith, C.A.B., ‘Some binary games’, Math. Gaz. 280 (1944), 96–103.CrossRefGoogle Scholar