DocumentCode :
2945820
Title :
On interval linear complexity of binary sequences
Author :
Balakirsky, V.B.
Author_Institution :
Data Security Assoc. Confident, St. Petersburg, Russia
fYear :
1995
fDate :
17-22 Sep 1995
Firstpage :
490
Abstract :
We consider the problem of partial approximation of binary sequences by the outputs of linear feedback shift registers. A generalization of the linear complexity profiles of binary sequences leads to a sequence that is regarded as the profile of interval linear complexity. Some properties of this sequence are examined
Keywords :
binary sequences; binary sequences; interval linear complexity; linear feedback shift registers; partial approximation; Binary sequences; Data security; Ear; Information analysis; Linear approximation; Linear feedback shift registers; Output feedback; Shift registers; Vectors;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Information Theory, 1995. Proceedings., 1995 IEEE International Symposium on
Conference_Location :
Whistler, BC
Print_ISBN :
0-7803-2453-6
Type :
conf
DOI :
10.1109/ISIT.1995.550477
Filename :
550477
Link To Document :
بازگشت