Homomorphic encoders of profinite abelian groups I

Abstract

Let \Gi :i∈\ be a family of finite Abelian groups. We say that a subgroup G≤ Πi∈ Gi is order controllable if for every i∈ N there is ni∈ N such that for each c∈ G, there exists c1∈ G satisfying that c1|[1,i]=c|[1,i], supp (c1)⊂eq [1,ni], and order(c1) divides order(c|[1,ni]). In this paper we investigate the structure of order controllable subgroups. It is proved that every order controllable, profinite, abelian group contains a subset \gn : n∈\ that topologically generates the group and whose elements gn 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 FH:2021.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…