On the asymptotic order of circuit codes
From MaRDI portal
Publication:2032977
DOI10.1016/j.dam.2021.05.003zbMath1487.94186arXiv1908.08817OpenAlexW3171664023MaRDI QIDQ2032977
Publication date: 14 June 2021
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1908.08817
Paths and cycles (05C38) Other types of codes (94B60) Structural characterization of families of graphs (05C75)
Related Items (1)
Cites Work
- On the maximum length of coil-in-the-box codes in dimension 8
- Construction of certain cyclic distance-preserving codes having linear-algebraic characteristics
- The maximum length of circuit codes with long bit runs and a new characterization theorem
- Snakes, coils, and single-track circuit codes with spread \(k\)
- Difference-preserving codes
- Convex Polytopes
- A New Method for Constructing Circuit Codes
- A Method for Constructing Circuit Codes
- Some results on the maximum length of circuits of spread k in the d-cube
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: On the asymptotic order of circuit codes