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

DOI10.1109/TIT.1978.1055874MaRDI QIDQ4159290zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• scientific article; zbMATH DE number 3912280
• Efficient generation of elementary sequences
• Increasing the rate of output of m-sequences
• An algebraic construction for q-ary shift register sequences
• Notes on \(q\)-ary interleaved sequences

Cited in

(10)

• Increasing the rate of output of m-sequences
• Analysis of \((k_ 0,k_ 1)\) clock-controlled sequences
• Theory of transformation groups of polynomials over \(\mathrm{GF}(2)\) with applications to linear shift register sequences
• Efficient generation of elementary sequences
• On the stability of m-sequences
• Concatenation Properties or δ-Sequences Over GF(2)
• scientific article; zbMATH DE number 3503137 (Why is no real title available?)
• An algebraic construction for q-ary shift register sequences
• On differentially encoded M-sequences
• Sequences with good correlation property based on depth and interleaving techniques

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.)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4159290)