Construction and decoding of BCH codes over finite commutative rings

DOI10.1016/S0024-3795(98)10163-5zbMath1049.94023OpenAlexW2152019963MaRDI QIDQ1301272

Reginaldo jun. Palazzo, Antonio Aparecido de Andrade

Publication date: 17 February 2000

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0024-3795(98)10163-5

zbMATH Keywords

BCH codesGalois extensionError-location numbersForney's methodModified Berlekamp-Massey algorithmSyndrome calculation

Mathematics Subject Classification ID

Cyclic codes (94B15) Decoding (94B35)

Related Items (6)

Construction and decoding of BCH codes over chain of commutative rings ⋮ Design of new \(4\times 4\) S-box from finite commutative chain rings ⋮ Maximal cyclic subgroups of the groups of units of Galois rings: a computational approach ⋮ Transmission of intra-cellular genetic information: a system proposal ⋮ Primitive to non-primitive BCH codes: An instantaneous path shifting scheme for data transmission ⋮ Algorithms for computing parameters of graph-based extensions of BCH codes

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Shift Register Synthesis (Modulo m)
• On BCH codes over arbitrary integer tings (Corresp.)
• The Z/sub 4/-linearity of Kerdock, Preparata, Goethals, and related codes
• On the decoding of Reed-Solomon and BCH codes over integer residue rings
• On decoding BCH codes

This page was built for publication: Construction and decoding of BCH codes over finite commutative rings