Artículos de revistas
Maximal cyclic subgroups of the groups of units of Galois rings: a computational approach
Fecha
2017-09-01Registro en:
Computational & Applied Mathematics. Heidelberg: Springer Heidelberg, v. 36, n. 3, p. 1273-1297, 2017.
0101-8205
10.1007/s40314-015-0281-9
WOS:000408226800011
WOS000408226800011.pdf
Autor
Quaid I Azam Univ
Universidade Estadual Paulista (Unesp)
Universidade Estadual de Campinas (UNICAMP)
Institución
Resumen
We present a computational approach based on algorithmic techniques to obtain maximal cyclic subgroups of the groups of units in Galois rings. The objective of this work was to provide an automated methodology to obtain such maximal cyclic subgroups for minimizing the human effort in such calculations. Necessity of getting a stock of maximal cyclic subgroups is due to their novel role in the formation of cyclic codes over finite commutative rings and prophesied shifting of S-box construction through binary field extensions GF(2(h)), 1 <= h <= 8 to these maximal cyclic subgroups of the groups of units of finite Galois rings GR(2(k), h).