DocumentCode :
934429
Title :
A large class of nonlinear shift register sequences (Corresp.)
Author :
Hemmati, Farhad
Volume :
28
Issue :
2
fYear :
1982
fDate :
3/1/1982 12:00:00 AM
Firstpage :
355
Lastpage :
359
Abstract :
The cycle structure of a binary linear shift register with connection polynomial 
, where 
is a primitive polynomial of degree 
over GF 
, is used to give several construction techniques for generation of shift-register sequences of length 
. It is shown that a class of nonlinear deBruijn cycles, where the number of elements is proportional to 
, can be constructed. The obtained cycles can be generated by simple 
-stage nonlinear feedback shift registers.
, where is a primitive polynomial of degree over GF , is used to give several construction techniques for generation of shift-register sequences of length . It is shown that a class of nonlinear deBruijn cycles, where the number of elements is proportional to , can be constructed. The obtained cycles can be generated by simple -stage nonlinear feedback shift registers.Keywords :
Shift-register sequences; Algorithm design and analysis; Block codes; Costs; Galois fields; Linear code; Maximum likelihood decoding; Polynomials; Propulsion; Shift registers; Strontium;
fLanguage :
English
Journal_Title :
Information Theory, IEEE Transactions on
Publisher :
ieee
ISSN :
0018-9448
Type :
jour
DOI :
10.1109/TIT.1982.1056469
Filename :
1056469
Link To Document :
