scientific article; zbMATH DE number 57521

MaRDI QIDQ4004545zbMATH OpenFDO

Authors Dayi Chen

Publication date 27 September 1992

zbMATH Keywords

Berlekamp-Massey algorithmerror locator polynomialerror-correcting capabilityfast decoding of Reed-Solomon codesFFT transformGalois field

Mathematics Subject Classification ID

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

Recommendations

• The fast decoding of Reed-Solomon codes using Fermat transforms (Corresp.)
• Fast algorithm for computing the roots of error locator polynomials up to degree 11 in Reed-Solomon decoders
• A New Algorithm for Decoding Reed-Solomon Codes
• scientific article; zbMATH DE number 3924676

Cited in

(28)

• Parallel decoding of the Reed-Solomon codes
• The generalized Goertzel algorithm and its parallel hardware implementation
• Inversionless decoding of both errors and erasures of Reed-Solomon code
• Advances in the performance of Reed-Solomon codes
• Fast tabular decoding method for multi-delimiter codes
• Recognition of RS coding based on Galois field Fourier transform
• Le Decodage Rapide Des Codes De Reed-Solomon Et Leur Generalisation
• A Universal Reed-Solomon Decoder
• Sparse factor graph representations of Reed-Solomon and related codes
• A New Algorithm for Decoding Reed-Solomon Codes
• scientific article; zbMATH DE number 4164732 (Why is no real title available?)
• Decoding Folded Reed–Solomon Codes Using Hensel-Lifting
• scientific article; zbMATH DE number 3924676 (Why is no real title available?)
• scientific article; zbMATH DE number 177859 (Why is no real title available?)
• On the complexity of decoding Reed-Solomon codes (Corresp.)
• High-speed \(\mathrm{RS}(255, 239)\) decoder based on LCC decoding
• The fast decoding of Reed-Solomon codes using Fermat transforms (Corresp.)
• Efficient decoding of Reed-Solomon codes beyond half the minimum distance
• Fast algorithm for computing the roots of error locator polynomials up to degree 11 in Reed-Solomon decoders
• Fast parallel algorithms for decoding Reed-Solomon codes based on remainder polynomials
• A Gröbner-Bases Approach to Syndrome-Based Fast Chase Decoding of Reed–Solomon Codes
• Fast Encoding Algorithms for Reed–Solomon Codes With Between Four and Seven Parity Symbols
• High-throughput Reed-Solomon decoder
• Fast Essentially Maximum Likelihood Decoding of the Golden Code
• Complexity of Decoding Positive-Rate Primitive Reed–Solomon Codes
• Reed-Solomon codes
• Simple Codes and Sparse Recovery with Fast Decoding
• The decoding of extended Reed-Solomon codes

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4004545)