|
| This Article | ||
| | ||
| Share | ||
| Bibliographic References | ||
| Add to: | ||
 Digg  Furl  Spurl  Blink  Simpy  Google  Del.icio.us  Y!MyWeb | ||
| Search | ||
| ||
December 1978 (vol. 27 no. 12)
pp. 1192-1195
| ASCII Text | x | ||
| F. Hemmati, D.J., Jr. Costello, "An Algebraic Construction for q-ary Shift Register Sequences," IEEE Transactions on Computers, vol. 27, no. 12, pp. 1192-1195, December, 1978. | |||
| BibTex | x | ||
| @article{ 10.1109/TC.1978.1675025, author = {F. Hemmati and D.J., Jr. Costello}, title = {An Algebraic Construction for q-ary Shift Register Sequences}, journal ={IEEE Transactions on Computers}, volume = {27}, number = {12}, issn = {0018-9340}, year = {1978}, pages = {1192-1195}, doi = {http://doi.ieeecomputersociety.org/10.1109/TC.1978.1675025}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, } | |||
| RefWorks Procite/RefMan/Endnote | x | ||
| TY - JOUR JO - IEEE Transactions on Computers TI - An Algebraic Construction for q-ary Shift Register Sequences IS - 12 SN - 0018-9340 SP1192 EP1195 EPD - 1192-1195 A1 - F. Hemmati, A1 - D.J., Jr. Costello, PY - 1978 KW - shift register sequence KW - Euclidean Algorithm KW - Hamming weight KW - maximal length cycle VL - 27 JA - IEEE Transactions on Computers ER - | |||
Using the Euclidean Algorithm for polynomials over GF(q), an algebraic technique for the generation of q-ary shift register sequences of arbitrary length l, 1 = l = qm, is obtained, where q is a power of a prime number, q = pn, and m is the number of shift register stages.
Index Terms:
shift register sequence, Euclidean Algorithm, Hamming weight, maximal length cycle
Citation:
F. Hemmati, D.J., Jr. Costello, "An Algebraic Construction for q-ary Shift Register Sequences," IEEE Transactions on Computers, vol. 27, no. 12, pp. 1192-1195, Dec. 1978, doi:10.1109/TC.1978.1675025
Usage of this product signifies your acceptance of the Terms of Use.