The Maximum Length and Isomorphism of Circuit Codes with Long Bit Runs
From MaRDI portal
Abstract: Recently, Byrnes presented a formula for the maximum length of a symmetric circuit code that has a long bit run and odd spread. Here we show that the formula is also valid when the spread is even. We also establish that all maximum length symmetric circuit codes with long bit runs are isomorphic for an infinite and nontrivial family of circuit codes, extending a previous result of Douglas.
This page was built for publication: The Maximum Length and Isomorphism of Circuit Codes with Long Bit Runs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6346889)
