An algebraic construction for q-ary shift register sequences

DOI10.1109/TC.1978.1675025zbMath0385.94019OpenAlexW2089853785MaRDI QIDQ4166694

Farhad Hemmati, Daniel J. jun. Costello

Publication date: 1978

Published in: IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/tc.1978.1675025

zbMATH Keywords

finite fieldspolynomialsEuclidean algorithmshift register sequences

Mathematics Subject Classification ID

Shift register sequences and sequences over finite alphabets in information and communication theory (94A55)

Related Items (2)

An algorithm for generating shift-register cycles ⋮ Maximal state complexity and generalized de Bruijn words

This page was built for publication: An algebraic construction for q-ary shift register sequences