Isomorphism of maximum length circuit codes
From MaRDI portal
Publication:2119935
DOI10.1007/s10623-021-01005-zzbMath1495.94141OpenAlexW4205576296WikidataQ114849797 ScholiaQ114849797MaRDI QIDQ2119935
Publication date: 31 March 2022
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10623-021-01005-z
Uses Software
Cites Work
- On the maximum length of coil-in-the-box codes in dimension 8
- On the snake-in-the-box codes for rank modulation under Kendall's \(\tau \)-metric
- A new lower bound for snake-in-the-box codes
- The snake-in-the-box problem: A new upper bound
- An upper bound on the size of the snake-in-the-box
- On the maximal length of a snake in hypercubes of small dimension
- On the asymptotic order of circuit codes
- Snake-in-the-box codes under the \(\ell_{\infty}\)-metric for rank modulation
- The maximum length of circuit codes with long bit runs and a new characterization theorem
- A tight analysis of the submodular-supermodular procedure
- Snakes, coils, and single-track circuit codes with spread \(k\)
- Perfect Snake-in-the-Box Codes for Rank Modulation
- Snake-in-the-Box Codes for Rank Modulation
- Difference-preserving codes
- Some new circuit codes
- Convex Polytopes
- Single-track circuit codes
- Periodic Orbits and Equilibria in Glass Models for Gene Regulatory Networks
- A New Method for Constructing Circuit Codes
- A Method for Constructing Circuit Codes
- Generalized Snake-in-the-Box Codes
- Lengths of snakes in boxes
- Some results on the maximum length of circuits of spread k in the d-cube
- Upper bounds on the length of circuits of even spread in the d-cube
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Isomorphism of maximum length circuit codes
