|
| This Article | ||
| ||
| Share | ||
| Bibliographic References | ||
| Add to: | ||
| | ||
| Search | ||
| ||
| ASCII Text | x | ||
| A.R. Smith, "General Shift-Register Sequences of Arbitrary Cycle Length," IEEE Transactions on Computers, vol. 20, no. 4, pp. 456-459, April, 1971. | |||
| BibTex | x | ||
| @article{ 10.1109/T-C.1971.223265, author = {A.R. Smith}, title = {General Shift-Register Sequences of Arbitrary Cycle Length}, journal ={IEEE Transactions on Computers}, volume = {20}, number = {4}, issn = {0018-9340}, year = {1971}, pages = {456-459}, doi = {http://doi.ieeecomputersociety.org/10.1109/T-C.1971.223265}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, } | |||
| RefWorks Procite/RefMan/Endnote | x | ||
| TY - JOUR JO - IEEE Transactions on Computers TI - General Shift-Register Sequences of Arbitrary Cycle Length IS - 4 SN - 0018-9340 SP456 EP459 EPD - 456-459 A1 - A.R. Smith, PY - 1971 KW - Coding theory KW - maximum-length cycle KW - shift-register sequence KW - zero free. VL - 20 JA - IEEE Transactions on Computers ER - | |||
An r-ary shift-register sequence is desired that has arbitrary cycle length L=rkfor arbitrary r and k, where k is the number of stages (degree) of the shift register. The existence of such sequences is established for "almost all" cycle lengths L. Furthermore, existence of such sequences which are "zero free" for almost all cycle lengths L is proved.
Index Terms:
Coding theory, maximum-length cycle, shift-register sequence, zero free.
Citation:
A.R. Smith, "General Shift-Register Sequences of Arbitrary Cycle Length," IEEE Transactions on Computers, vol. 20, no. 4, pp. 456-459, April 1971, doi:10.1109/T-C.1971.223265
Usage of this product signifies your acceptance of the Terms of Use.

