Homomorphic encoders of profinite abelian groups II
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 group codes. It is proved that if G is an order controllable, shift invariant, group code over a finite abelian group H, then G possesses a finite canonical generating set. Furthermore, our construction also yields that G is algebraically conjugate to a full group shift.
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.