Any strongly controllable group system or group shift or any linear block code is isomorphic to a generator group
Kenneth M. Mackenthun Jr

TL;DR
This paper proves that any strongly controllable group system, including linear block codes and group shifts, is isomorphic to a generator group, revealing a fundamental structure that unifies various algebraic systems.
Contribution
It establishes an isomorphism between strongly controllable group systems and generator groups, introducing a tensor-based representation and elementary systems with a tile-like structure.
Findings
Any strongly controllable group system is isomorphic to a generator group.
The generator group is represented as a tensor space with a tile-like elementary system.
The results unify algebraic systems like linear codes and group shifts under a common framework.
Abstract
Consider any sequence of finite groups , where takes values in an integer index set . A group system is a set of sequences with components in that forms a group under componentwise addition in , for each . As shown previously, any strongly controllable complete group system can be decomposed into generators. We study permutations of the generators when sequences in the group system are multiplied. We show that any strongly controllable complete group system is isomorphic to a generator group . The set is a set of tensors, a double Cartesian product space of sets , with indices , for , and time , for . is a set of unique generator labels for the generators in with nontrivial span for the time interval . We show the generator…
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 · graph theory and CDMA systems · Cellular Automata and Applications
