An algorithm for shifted continued fract
β
Harald Niederreiter; Michael Vielhaber
π
Article
π
1999
π
Elsevier Science
π
English
β 119 KB
The linear complexity proΓΏle of a sequence of length n is readily obtained in O(n 2 ) steps by the Berlekamp-Massey algorithm (BMA). Piper demands that the linear complexity proΓΏles should be acceptable for every starting point, that is, for all shifted sequences as well. By repetition of the BMA, t