A method for improving the code rate and error correction capability of a cyclic code

DOI10.1007/s40314-013-0010-1zbMath1284.94157OpenAlexW1494427705MaRDI QIDQ361981

Mohammad Hasan, M. Dambrine

Publication date: 20 August 2013

Published in: Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s40314-013-0010-1

zbMATH Keywords

polynomial ringsemigroup ringbinary cyclic codebinary Hamming code

Mathematics Subject Classification ID

Cyclic codes (94B15)

Related Items

Primitive to non-primitive BCH codes: An instantaneous path shifting scheme for data transmission ⋮ Characterization of cyclic codes over {ℬ[X;(1/m)Z₀}_{m > 1}and efficient encoding decoding algorithm for cyclic codes]

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Encoding through generalized polynomial codes
• 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
• Divisibility properties in semigroup rings
• Linear Codes over Finite Rings