Homomorphic encoders of profinite abelian groups I
Mar\'ia V. Ferrer, Salvador Hern\'andez

TL;DR
This paper studies the structure of order controllable subgroups of profinite abelian groups, showing they can be generated by elements with finite support and providing conditions for their topological encoding, with applications to group codes.
Contribution
It introduces the concept of order controllability for subgroups of profinite abelian groups and establishes their structural properties and encoding conditions.
Findings
Order controllable profinite abelian groups are topologically generated by elements with finite support.
Sufficient conditions for encoding these groups via topological isomorphisms.
Applications to group coding theory are discussed.
Abstract
Let be a family of finite Abelian groups. We say that a subgroup is \emph{order controllable} if for every there is such that for each , there exists satisfying that , , and order divides order. In this paper we investigate the structure of order controllable subgroups. It is proved that every order controllable, profinite, abelian group contains a subset that topologically generates the group and whose elements all have finite support. As a consequence, sufficient conditions are obtained that allow us to encode, by means of a topological group isomorphism, order controllable profinite abelian groups. Some applications of these results to group codes will appear subsequently…
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
TopicsCooperative Communication and Network Coding · Cellular Automata and Applications · Coding theory and cryptography
