DocumentCode :
909842
Title :
On trinomial recurrences
Author :
Goldstein, Richard M. ; Zierler, Neal
Volume :
14
Issue :
1
fYear :
1968
fDate :
1/1/1968 12:00:00 AM
Firstpage :
150
Lastpage :
151
Abstract :
Let 
be the set of all linear recurring sequences generated by a polynomial 
. It is shown that the linear functional advancing the phase of every sequence in by 
may be obtained essentially as the th state of a certain member of depending only on when and only when is a binomial or trinomial.
be the set of all linear recurring sequences generated by a polynomial . It is shown that the linear functional advancing the phase of every sequence in by may be obtained essentially as the th state of a certain member of depending only on when and only when is a binomial or trinomial.Keywords :
Polynomials; Sequences; Combinatorial mathematics; Decoding; Error correction codes; Information theory; Intersymbol interference; Laboratories; Machine tools; Polynomials; Propulsion; Space technology;
fLanguage :
English
Journal_Title :
Information Theory, IEEE Transactions on
Publisher :
ieee
ISSN :
0018-9448
Type :
jour
DOI :
10.1109/TIT.1968.1054086
Filename :
1054086
Link To Document :
