On the asymptotic order of circuit codes

DOI10.1016/J.DAM.2021.05.003MaRDI QIDQ2032977zbMATH OpenOpenAlexFDO

Authors Kevin M. Byrnes, Florin Spinu

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

zbMATH Keywords

circuit codecoil in the boxerror correcting codek-coilsnake in the box

Mathematics Subject Classification ID

Paths and cycles (05C38) Structural characterization of families of graphs (05C75) Other types of codes (94B60)

Abstract: In this note we prove that the maximum length of a $d$-dimensional circuit code of spread $k$ equals $2^{d+O_k(lo{g}^{2}d)}$, with the implied constant depending only on $k$.

Recommendations

• Some new bounds for the maximum length of circuit codes (Corresp.)
• The maximum length of circuit codes with long bit runs and a new characterization theorem
• Some results on the maximum length of circuits of spread k in the d-cube
• A new upper bound for the length of snakes
• Isomorphism of maximum length circuit codes

Cites work

• A Method for Constructing Circuit Codes
• A New Method for Constructing Circuit Codes
• Construction of certain cyclic distance-preserving codes having linear-algebraic characteristics
• Convex Polytopes
• Difference-preserving codes
• Finite fields and applications
• scientific article; zbMATH DE number 36687 (Why is no real title available?)
• scientific article; zbMATH DE number 607286 (Why is no real title available?)
• scientific article; zbMATH DE number 964350 (Why is no real title available?)
• On the maximum length of coil-in-the-box codes in dimension 8
• Snakes, coils, and single-track circuit codes with spread \(k\)
• Some results on the maximum length of circuits of spread k in the d-cube
• The maximum length of circuit codes with long bit runs and a new characterization theorem

Cited in

(8)

• Modified order and stepsize strategies in Adams codes
• Isomorphism of maximum length circuit codes
• The maximum length of circuit codes with long bit runs and a new characterization theorem
• Some new bounds for the maximum length of circuit codes (Corresp.)
• scientific article; zbMATH DE number 45017 (Why is no real title available?)
• scientific article; zbMATH DE number 2187726 (Why is no real title available?)
• Some results on the maximum length of circuits of spread k in the d-cube
• Note on Circuits and Chains of Spread k in the n-Cube

This page was built for publication: On the asymptotic order of circuit codes

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