On the maximum length of coil-in-the-box codes in dimension 8

DOI10.1016/j.dam.2014.07.010zbMath1303.05053OpenAlexW2010404904WikidataQ60692137 ScholiaQ60692137MaRDI QIDQ477349

Ville H. Pettersson, Patric R. J. Östergård

Publication date: 3 December 2014

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

Full work available at URL: https://doi.org/10.1016/j.dam.2014.07.010

zbMATH Keywords

induced cyclecanonical augmentationcircuit codecoil-in-the-box codesnake-in-the-box code

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38) Distance in graphs (05C12)

Related Items (4)

Isomorphism of maximum length circuit codes ⋮ On the asymptotic order of circuit codes ⋮ The maximum length of circuit codes with long bit runs and a new characterization theorem ⋮ Exhaustive search for snake-in-the-box codes

Uses Software

• nauty
• OEIS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Switching codes and designs
• Classification algorithms for codes and designs
• A new lower bound for snake-in-the-box codes
• An upper bound on the size of the snake-in-the-box
• Snake-in-the-Box Codes for Rank Modulation
• Computing Binary Combinatorial Gray Codes Via Exhaustive Search With SAT Solvers
• Isomorph-Free Exhaustive Generation
• Some new circuit codes

This page was built for publication: On the maximum length of coil-in-the-box codes in dimension 8