Constructions of codes through the semigroup ring \(B[X;\frac{1}{2^2}\mathbb Z_0]\) and encoding
From MaRDI portal
Publication:660789
DOI10.1016/j.camwa.2011.05.056zbMath1231.94073OpenAlexW1509823465MaRDI QIDQ660789
Tariq Shah, Antonio Aparecido de Andrade, Atlas Khan
Publication date: 5 February 2012
Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.camwa.2011.05.056
Related Items (5)
CYCLIC CODES THROUGH B[X, $B[X;\frac{1}{kp}Z_{0}]$ AND $B[X;\frac{1}{p^{k}}Z_{0}]$: A COMPARISON] ⋮ A method for improving the code rate and error correction capability of a cyclic code ⋮ Maximal cyclic subgroups of the groups of units of Galois rings: a computational approach ⋮ On codes over quaternion integers ⋮ Characterization of cyclic codes over {ℬ[X;(1/m)Z0}m > 1and efficient encoding decoding algorithm for cyclic codes]
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Encoding through generalized polynomial codes
- An algorithm for computing the minimum distances of extensions of BCH codes embedded in semigroup rings
- Generators and weights of polynomial codes
- Algorithms for computing parameters of graph-based extensions of BCH codes
- Linear Codes over Finite Rings
- Srivastava codes
This page was built for publication: Constructions of codes through the semigroup ring \(B[X;\frac{1}{2^2}\mathbb Z_0]\) and encoding
