Loading [a11y]/accessibility-menu.js
A fast algorithm for determining the complexity of a binary sequence with period2^n(Corresp.) | IEEE Journals & Magazine | IEEE Xplore

A fast algorithm for determining the complexity of a binary sequence with period2^n(Corresp.)


Abstract:

The complexity of a periodic sequence(s)is defined to be the least number of stages in a linear feedback shift register that generates(s).

Abstract:

The complexity of a periodic sequence(s)is defined to be the least number of stages in a linear feedback shift register that generates(s).
Published in: IEEE Transactions on Information Theory ( Volume: 29, Issue: 1, January 1983)
Page(s): 144 - 146
Date of Publication: 06 January 2003

ISSN Information:


References

References is not available for this document.