Symmetry Implies Isomorphism for Certain Maximum Length Circuit Codes
Kevin M. Byrnes

TL;DR
This paper extends a classic theorem on maximum length circuit codes, showing that symmetry implies isomorphism in certain cases, thereby broadening understanding of code structure for specific parameters.
Contribution
It generalizes Douglas's theorem to even spread values, proving all maximum length symmetric circuit codes are isomorphic under new conditions.
Findings
All maximum length symmetric circuit codes are isomorphic for even spread k ≥ 4 and specific dimensions.
Extension of Douglas's theorem to new parameter ranges.
Provides a unified understanding of code isomorphism under symmetry constraints.
Abstract
A classic result due to Douglas establishes that, for odd spread and dimension , all maximum length circuit codes are isomorphic. Using a recent result of Byrnes we extend Douglas's theorem to prove that, for even and , all maximum length symmetric circuit codes are isomorphic.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCoding theory and cryptography · Multilevel Inverters and Converters · Cellular Automata and Applications
