Simple algorithms for decoding systematic Reed-Solomon codes
From MaRDI portal
Publication:356717
DOI10.1007/s10623-012-9626-1zbMath1330.94061OpenAlexW1975709480MaRDI QIDQ356717
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
Related Items (1)
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
This page was built for publication: Simple algorithms for decoding systematic Reed-Solomon codes