Using Lagrange's interpolation formula to construct Reed-Solomon codes over GF(p)

DOI10.1049/EL:19880116MaRDI QIDQ4731136zbMATH OpenOpenAlexFDO

Authors

Publication date 1988

Published in Electronics Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1049/el:19880116

zbMATH Keywords

BCH codesFourier transformLagrange's interpolation formulaReed-Solomon code

Mathematics Subject Classification ID

Cyclic codes (94B15)

Recommendations

• Homogeneous interpolation problem and key equation for decoding Reed- Solomon codes
• Interpolation in list decoding of Reed-Solomon codes
• An Interpolation Procedure for List Decoding Reed–Solomon Codes Based on Generalized Key Equations
• Algebraic Decoding of a Class of Binary Cyclic Codes Via Lagrange Interpolation Formula
• A Note on Interleaved Reed–Solomon Codes Over Galois Rings
• A Parametric Approach to List Decoding of Reed-Solomon Codes Using Interpolation
• A complexity-reduced interpolation algorithm for soft-decision decoding of Reed-Solomon codes
• A new Reed-Solomon code decoding algorithm based on Newton's interpolation
• On the minimal interpolation problem and decoding RS codes
• Iterative Algebraic Soft-Decision List Decoding of Reed-Solomon Codes

This page was built for publication: Using Lagrange's interpolation formula to construct Reed-Solomon codes over GF(p)

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