Binary codes that do not preserve primitivity
\v{S}t\v{e}p\'an Holub, Martin Ra\v{s}ka, \v{S}t\v{e}p\'an Starosta

TL;DR
None
Contribution
None
Abstract
A code is not primitivity preserving if there is a primitive list whose concatenation is imprimitive. We formalize a full characterization of such codes in the binary case in the proof assistant Isabelle/HOL. Part of the formalization, interesting on its own, is a description of -interpretations of the square if . We also provide a formalized parametric solution of the related equation .
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.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCoding theory and cryptography · semigroups and automata theory · Computability, Logic, AI Algorithms
