Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computer Science Applications
Reference34 articles.
1. Abbot H.L., Katchalski M.: On the construction of snake in the box codes. Utilit. Math. 40, 97–116 (1991).
2. Allison D., Paulusma D.: New bounds for the snake-in-the-box problem. arXiv:1603.05119 (2016).
3. Byrnes K.M.: A tight analysis of the submodular-supermodular procedure. Discret. Appl. Math. 186, 275–282 (2015).
4. Byrnes K.M.: A new method for constructing circuit codes. Bull. ICA 80, 40–60 (2017).
5. Byrnes K.M.: The maximum length of circuit codes with long bit runs and a new characterization theorem. Des. Codes Cryptogr. 87(11), 2671–2681 (2019).