Error-correcting codes on the towers of Hanoi graphs

Discrete Mathematics

Volumn 208-209, Issue , 1999, Pages 157-175

  Cull, Paul ^a   Nelson, Ingrid ^b  

^a Oregon State University   (United States)

^b Dept of Economics and Thomas Jefferson Program in Public Policy at the College of William and Mary   (United States)

Author keywords

Codes on graphs; Error correcting codes; NP complete; Towers of Hanoi

Indexed keywords

EID: 0012279695     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0012-365X(99)00070-9     Document Type: Article

References (4)

1. P. Cull, E.F. Ecklund Jr, Towers of Hanoi and analysis of algorithms, Amer. Math. Monthly 92 (1985) 407-420.
2. M. Garey, D. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, Freeman, San Francisco, 1979.
3. R. Hill. A First Course in Coding Theory, Oxford University Press, Oxford, 1986.
4. F.J. MacWilliams, N.J.A. Sloane, The Theory of Error-Correcting Codes, North-Holland, Amsterdam, 1977.