Title :
Fast rational interpolation, Reed-Solomon decoding, and the linear complexity profiles of sequences
Author :
Blackburn, Simon R.
Author_Institution :
Dept. of Math., London Univ., UK
fDate :
3/1/1997 12:00:00 AM
Abstract :
An asymptotically fast algorithm for solving the generalized rational interpolation problem is presented. This problem has been studied as part of system theory and is related to the solution of the classical and Welch-Berlekamp (1983) key equations which arise in Reed-Solomon decoding. The algorithm can also be used to compute the linear complexity profile of a binary sequence of length m using only O(m(log m)2 log log m) bit operations
Keywords :
Reed-Solomon codes; binary sequences; computational complexity; decoding; interpolation; system theory; Reed-Solomon decoding; Welch-Berlekamp key equations; asymptotically fast algorithm; binary sequence length; fast rational interpolation; generalized rational interpolation; linear complexity profiles; system theory; Algorithm design and analysis; Binary sequences; Cryptography; Decoding; Equations; Helium; Interpolation; Mathematics; Polynomials; Reed-Solomon codes;
Journal_Title :
Information Theory, IEEE Transactions on
