Characterization of cyclic codes over {ℬ[X;(1/m)Z0]}m > 1and efficient encoding decoding algorithm for cyclic codes

DOI10.1080/00207160.2016.1158815zbMath1421.94106OpenAlexW2313217803MaRDI QIDQ4976304

Naveed Ahmed Azam, Tariq Shah

Publication date: 28 July 2017

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207160.2016.1158815

zbMATH Keywords

semigroup ringspolynomial ringscyclic codeserror detection and correction

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cyclic codes (94B15) Decoding (94B35)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A Mathematical Theory of Communication
• A method for improving the code rate and error correction capability of a cyclic code
• 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
• Classical codes as ideals in group algebras
• Semigroup rings as Prüfer rings
• A decoding method of an n length binary BCH code through (n + 1)n length binary cyclic code
• A new transmission model in cognitive radio based on cyclic generalized polynomial codes for bandwidth reduction
• Une generalisation de la construction de berman des codes de reed et muller p-aires
• Decoding of linear codes over Galois rings
• On the theory of group codes

This page was built for publication: Characterization of cyclic codes over {ℬ[X;(1/m)Z₀]}_{m > 1}and efficient encoding decoding algorithm for cyclic codes