Fast rational interpolation, Reed-Solomon decoding, and the linear complexity profiles of sequences

DOI10.1109/18.556111MaRDI QIDQ4340323zbMATH OpenOpenAlexFDO

Authors Simon R. Blackburn

Publication date 23 February 1998

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/18.556111

zbMATH Keywords

rational interpolationlinear complexityinterpolation algorithmsReed-Solomon decodingkey equations

Mathematics Subject Classification ID

Complexity and performance of numerical algorithms (65Y20) Numerical interpolation (65D05) Approximation by rational functions (41A20) Decoding (94B35)

Recommendations

• A generalized rational interpolation problem and the solution of the Welch-Berlekamp key equation
• A new Reed-Solomon code decoding algorithm based on Newton's interpolation
• On the minimal interpolation problem and decoding RS codes
• Key equations for list decoding of Reed-Solomon codes and how to solve them

Cited in

(8)

• Generalized Rational Interpolation Over Commutative Rings and Remainder Decoding
• scientific article; zbMATH DE number 1740034 (Why is no real title available?)
• Recovering highly-complex linear recurrences of integer sequences
• Polynomial-division-based algorithms for computing linear recurrence relations
• Fast algorithms for determining the linear complexities of sequences over \(GF(p^{m})\) with the period \(3 n\)
• Fast algorithm for computing the roots of error locator polynomials up to degree 11 in Reed-Solomon decoders
• Rational complexity of binary sequences, F\(\mathbb{Q}\)SRs, and pseudo-ultrametric continued fractions in \(\mathbb{R}\)
• On sequences, rational functions and decomposition

This page was built for publication: Fast rational interpolation, Reed-Solomon decoding, and the linear complexity profiles of sequences

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