id: 05976099
dt: j
an: 05976099
au: Edemskiy, Vladimir
ti: About computation of the linear complexity of generalized cyclotomic
    sequences with period $p^{n+1}$.
so: Des. Codes Cryptography 61, No. 3, 251-260 (2011).
py: 2011
pu: Springer, Norwell, MA
la: EN
cc: 
ut: linear complexity; generalized cyclotomic sequences
ci: 
li: doi:10.1007/s10623-010-9474-9
ab: Summary: We propose a computational method for the linear complexity of
    series of generalized cyclotomic sequences with period $p^{n+1}$. This
    method is based on using the polynomial of the classical cyclotomic
    sequences of period $p$. We find the linear complexity of generalized
    cyclotomic sequences corresponding to the classes of biquadratic
    residues and Hall sequences.
rv: