Efficient generation of elementary sequences

DOI10.1007/978-3-642-45239-0_2MaRDI QIDQ2870082zbMATH OpenOpenAlexFDO

Authors David R. Gardner, Ana Sălăgean, Raphael C.-W. Phan

Publication date 17 January 2014

Published in Cryptography and Coding (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-45239-0_2

zbMATH Keywords

\(m\)-sequenceselementary sequencesFibonacci LFSRGalois LFSRinterleaving

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

• Interlacing properties of shift-register sequences with generator polynomials irreducible over<tex>GF(p)</tex>(Corresp.)
• Generalization of m-sequences and fast generation of a class of M- sequences
• scientific article; zbMATH DE number 3912280
• Primitive polynomials and m-sequences over GF(q/sup m/)
• An algorithm for generating M-sequences using the amalgamation-circles method in F₂

Cited in

(4)

• scientific article; zbMATH DE number 5116825 (Why is no real title available?)
• Windmill Generators A generalization and an observation of how many there are
• Increasing the rate of output for m sequences
• Interlacing properties of shift-register sequences with generator polynomials irreducible over<tex>GF(p)</tex>(Corresp.)

This page was built for publication: Efficient generation of elementary sequences

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