Interlacing properties of shift-register sequences with generator polynomials irreducible over<tex>GF(p)</tex>(Corresp.)

DOI10.1109/TIT.1978.1055874zbMath0378.94008OpenAlexW1973977412MaRDI QIDQ4159290

Franz Surböck, Hans Weinrichter

Publication date: 1978

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

Full work available at URL: https://doi.org/10.1109/tit.1978.1055874

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Shift register sequences and sequences over finite alphabets in information and communication theory (94A55)

Related Items (4)

Increasing the rate of output of \(m\)-sequences ⋮ On the Stability of m-Sequences ⋮ Analysis of \((k_ 0,k_ 1)\) clock-controlled sequences ⋮ Concatenation Properties or δ-Sequences Over GF(2)

This page was built for publication: Interlacing properties of shift-register sequences with generator polynomials irreducible over&lt;tex&gt;GF(p)&lt;/tex&gt;(Corresp.)