Perfect codes on the Towers of Hanoi graph

被引：15
|
作者：
Li, CK
Nelson, T
机构：
[1] Coll William & Mary, Dept Math, Williamsburg, VA 23187 USA
[2] Lockheed Martin Fed Syst, Boulder, CO 80302 USA
来源：
BULLETIN OF THE AUSTRALIAN MATHEMATICAL SOCIETY | 1998年 / 57卷 / 03期
关键词：
D O I：
10.1017/S0004972700031774
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
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.
引用
收藏
页码：367 / 376
页数：10
相关论文
共 50 条
  • [1] Error-correcting codes on the towers of Hanoi graphs
    Cull, Paul
    Nelson, Ingrid
    Discrete Mathematics, 1999, 208-209 : 157 - 175
  • [2] Error-correcting codes on the towers of Hanoi graphs
    Cull, P
    Nelson, I
    DISCRETE MATHEMATICS, 1999, 208 : 157 - 175
  • [3] On the total edge irregularity strength of three towers hanoi graph
    Farida, H.
    Indriati, D.
    2ND INTERNATIONAL CONFERENCE OF COMBINATORICS, GRAPH THEORY, AND NETWORK TOPOLOGY, 2019,
  • [4] The Towers of Hanoi
    Morris, George C.
    TEACHING MATHEMATICS AND ITS APPLICATIONS, 2007, 26 (04): : 179 - 186
  • [5] Perfect codes in direct graph bundles
    Ladinek, Irena Hrastnik
    Zerovnik, Janez
    INFORMATION PROCESSING LETTERS, 2015, 115 (09) : 707 - 711
  • [6] TOWERS OF HANOI GRAPHS
    LU, XM
    INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS, 1986, 19 (01) : 23 - 38
  • [7] THE TOWERS OF HANOI PROBLEM
    ROHL, JS
    COMPUTER JOURNAL, 1985, 28 (03): : 350 - 350
  • [8] Twin Towers of Hanoi
    Sunic, Zoran
    EUROPEAN JOURNAL OF COMBINATORICS, 2012, 33 (07) : 1691 - 1707
  • [9] HANOI TOWERS AND AUTOMATONS
    ALLOUCHE, JP
    DRESS, F
    RAIRO-INFORMATIQUE THEORIQUE ET APPLICATIONS-THEORETICAL INFORMATICS AND APPLICATIONS, 1990, 24 (01): : 1 - 15
  • [10] THE TOWERS OF HANOI PROBLEM
    BUNEMAN, P
    LEVY, L
    INFORMATION PROCESSING LETTERS, 1980, 10 (4-5) : 243 - 244
12345