Fast Algorithms for Determining the Linear Complexity of Period Sequences
INDOCRYPT '02 Proceedings of the Third International Conference on Cryptology: Progress in Cryptology
A new rateless code with unequal error protection property
Computers and Electrical Engineering
| Hi-index | 754.84 |
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