DocumentCode
3432188
Title
On periodic sequences of the maximum linear complexity and M-sequences
Author
Imamura, Kousuke ; Xiao, Guo-Zhen
Author_Institution
Kyushu Inst. of Technol., Fukuoka, Japan
fYear
1992
fDate
16-20 Nov 1992
Firstpage
1219
Abstract
This paper gives another proof of a maximum linear complexity property of the periodic sequences over GF (q ) of period T =q m-1 obtained by the minimum changes of an m-sequence, and shows that the converse is also true if the period T =q m-1 is a prime number
Keywords
binary sequences; shift registers; M-sequences; linear feedback shift register; maximum linear complexity; minimum changes; periodic sequences; Art; Cities and towns; Linear feedback shift registers;
fLanguage
English
Publisher
ieee
Conference_Titel
Singapore ICCS/ISITA '92. 'Communications on the Move'
Print_ISBN
0-7803-0803-4
Type
conf
DOI
10.1109/ICCS.1992.255067
Filename
255067
Link To Document