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

DOI10.1109/18.556111zbMATH Open0883.65002OpenAlexW2156036198MaRDI QIDQ4340323FDOQ4340323

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)

Cited In (7)

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

   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 👍 👎

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)