CYCLIC CODES THROUGH B[X], $B[X;\frac{1}{kp}Z_{0}]$ AND $B[X;\frac{1}{p^{k}}Z_{0}]$: A COMPARISON

DOI10.1142/S0219498812500788zbMath1255.94085OpenAlexW1860025141MaRDI QIDQ2909809

Tariq Shah, Antonio Aparecido de Andrade

Publication date: 6 September 2012

Published in: Journal of Algebra and Its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0219498812500788

zbMATH Keywords

cyclic codesemigroup ringBCH codeGoppa codeSrivastava codealternant code

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Cyclic codes (94B15)

Related Items (2)

Maximal cyclic subgroups of the groups of units of Galois rings: a computational approach ⋮ Primitive to non-primitive BCH codes: An instantaneous path shifting scheme for data transmission

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Constructions of codes through the semigroup ring \(B[X;\frac{1}{2^2}\mathbb Z_0\) and encoding]
• An algorithm for computing the minimum distances of extensions of BCH codes embedded in semigroup rings
• Generators and weights of polynomial codes
• Modular and \(p\)-adic cyclic codes
• Algorithms for computing parameters of graph-based extensions of BCH codes
• Codes over integer residue rings
• Srivastava codes
• Codes over certain rings

This page was built for publication: CYCLIC CODES THROUGH B[X], $B[X;\frac{1}{kp}Z_{0}]$ AND $B[X;\frac{1}{p^{k}}Z_{0}]$: A COMPARISON