Maximal cyclic subgroups of the groups of units of Galois rings: a computational approach
From MaRDI portal
Publication:2403110
DOI10.1007/s40314-015-0281-9zbMath1400.94193OpenAlexW2304222531MaRDI QIDQ2403110
Tariq Shah, Antonio Aparecido de Andrade, Reginaldo jun. Palazzo, Nasir Mehmood
Publication date: 15 September 2017
Published in: Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/11449/163157
Cites Work
- Encoding through generalized polynomial codes
- Constructions of codes through the semigroup ring \(B[X;\frac{1}{2^2}\mathbb Z_0\) and encoding]
- Construction and decoding of BCH codes over finite commutative rings
- Construction and decoding of BCH codes over chain of commutative rings
- Literature survey on nonlinear components and chaotic nonlinear components of block ciphers
- CYCLIC CODES THROUGH B[X, $B[X;\frac{1}{kp}Z_{0}]$ AND $B[X;\frac{1}{p^{k}}Z_{0}]$: A COMPARISON]
- Advanced Differential-Style Cryptanalysis of the NSA's Skipjack Block Cipher
- On BCH codes over arbitrary integer tings (Corresp.)
- Upper bound for a hybrid sum over Galois rings with applications to aperiodic correlation of some q-ary sequences
- CYCLIC CODES THROUGH $B[X;\frac{a}{b}{\mathbb Z}_{0}$, WITH $\frac{a}{b}\in {\mathbb Q}^{+}$ AND b = a+1, AND ENCODING]
- Linear Codes over Finite Rings
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Maximal cyclic subgroups of the groups of units of Galois rings: a computational approach