Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
153 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
45 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Homomorphic encoders of profinite abelian groups II (2111.15586v1)

Published 30 Nov 2021 in math.GN, cs.IT, math.GR, and math.IT

Abstract: Let ${G_i :i\in\N}$ be a family of finite Abelian groups. We say that a subgroup $G\leq \prod\limits_{i\in \N}G_i$ is \emph{order controllable} if for every $i\in \mathbb{N}$ there is $n_i\in \mathbb{N}$ such that for each $c\in G$, there exists $c_1\in G$ satisfying that $c_{1|[1,i]}=c_{|[1,i]}$, $supp (c_1)\subseteq [1,n_i]$, and order$(c_1)$ divides order$(c_{|[1,n_i]})$. 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.

Citations (1)

Summary

We haven't generated a summary for this paper yet.