2000 character limit reached
Schur ring and Codes for $S$-subgroups over $\Z_{2}^{n}$ (1906.04250v1)
Published 10 Jun 2019 in math.CO, cs.IT, math.GR, and math.IT
Abstract: In this paper the relationship between $S$-subgroups in $\Z_{2}{n}$ and binary codes is shown. If the codes used are both $P(T)$-codes and $G$-codes, then the $S$-subgroup is free. The codes constructed are cyclic, decimated or symmetric and the $S$-subgroups obtained are free under the action the cyclic permutation subgroup, invariants under the action the decimated permutation subgroup and symmetric under the action of symmetric permutation subgroup, respectively. Also it is shows that there is no codes generating whole $\Z_{2}{n}$ in any $\G_{n}(a)$-complete $S$-set of the $S$-ring $\mathfrak{S}(\Z_{2}{n},S_{n})$.