Simple algorithms for decoding systematic Reed-Solomon codes

DOI10.1007/s10623-012-9626-1zbMath1330.94061MaRDI QIDQ356717

Todd D. Mateer

Publication date: 26 July 2013

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10623-012-9626-1

zbMATH Keywords

BCH codes; Reed-Solomon codes; Euclidean algorithm; erasure decoding; systematic codes

Mathematics Subject Classification ID

94B05: Linear codes (general theory)

94B15: Cyclic codes

94B35: Decoding

Related Items

A Decoding Approach to Reed–Solomon Codes from Their Definition

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A method for computation of the discrete Fourier transform over a finite field
• A method for fast computation of the Fourier transform over a finite field
• Polynomial Codes Over Certain Finite Fields
• A New Algorithm for Decoding Reed-Solomon Codes
• A Simple Algorithm for Decoding Reed–Solomon Codes and its Relation to the Welch–Berlekamp Algorithm
• Correction to “A Simple Algorithm for Decoding Reed–Solomon Codes and Its Relation to the Welch–Berlekamp Algorithm”
• Decoding of redundant residue polynomial codes using Euclid's algorithm
• Error Correction Coding
• Additive Fast Fourier Transforms Over Finite Fields
• A Class of Error-Correcting Codes in $p^m $ Symbols
• Shift-register synthesis and BCH decoding
• Algebraic Codes for Data Transmission