Error-correcting codes on the Towers of Hanoi graphs

DOI10.1016/S0012-365X(99)00070-9zbMATH Open0957.94052OpenAlexW1965182118MaRDI QIDQ1808786FDOQ1808786

Authors: Paul Cull, Ingrid Nelson 

Publication date: 29 March 2001

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0012-365x(99)00070-9

Recommendations

• scientific article; zbMATH DE number 1289747
• Perfect codes on the towers of Hanoi graph
• The Cyclic Towers of Hanoi and Pseudo Ternary Codes

zbMATH Keywords

NP-completeTowers of Hanoicodes on graphsperfect one-error-correcting code

Mathematics Subject Classification ID

Applications of graph theory (05C90) Graph theory (including graph drawing) in computer science (68R10) Other types of codes (94B60)

Cited In (21)

• New results on variants of covering codes in Sierpiński graphs
• A survey and classification of Sierpiński-type graphs
• SOLENOIDAL MAPS, AUTOMATIC SEQUENCES, VAN DER PUT SERIES, AND MEALY AUTOMATA
• Shortest paths in Sierpiński graphs
• Total perfect codes in graphs realized by commutative rings
• Metric properties of the Tower of Hanoi graphs and Stern's diatomic sequence
• Characterizing \(r\)-perfect codes in direct products of two and three cycles
• The \((d, 1)\)-total labelling of Sierpiński-like graphs
• The (non-)existence of perfect codes in Fibonacci cubes
• An almost complete description of perfect codes in direct products of cycles
• Title not available (Why is that?)
• On perfect codes in Cartesian products of graphs
• Maximum matchings and minimum dominating sets in Apollonian networks and extended tower of Hanoi graphs
• Perfect codes in direct products of cycles-a complete characterization
• On the planarity of Hanoi graphs
• Error-correcting codes from graphs
• Perfect codes and universal adjacency spectra of commuting graphs of finite groups
• Coloring Hanoi and Sierpiński graphs
• Graphs that are simultaneously efficient open domination and efficient closed domination graphs
• 1-perfect codes in Sierpiński graphs
• The linear \(t\)-colorings of Sierpiński-like graphs

This page was built for publication: Error-correcting codes on the Towers of Hanoi graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1808786)