Perfect codes on the towers of Hanoi graph
From MaRDI portal
Publication:4209913
DOI10.1017/S0004972700031774zbMath0917.94017MaRDI QIDQ4209913
Publication date: 28 September 1998
Published in: Bulletin of the Australian Mathematical Society (Search for Journal in Brave)
perfect codes; Towers of Hanoi puzzle; 1-error correcting code; perfect \(k\)-error correcting codes
Related Items
Perfect codes and universal adjacency spectra of commuting graphs of finite groups, Total perfect codes in Cayley graphs, A survey and classification of Sierpiński-type graphs, Subgroup perfect codes in Cayley sum graphs, Maximum matchings and minimum dominating sets in Apollonian networks and extended tower of Hanoi graphs, Perfect codes in power graphs of finite groups, Metric properties of the Tower of Hanoi graphs and Stern's diatomic sequence, New results on variants of covering codes in Sierpiński graphs
Cites Work