Increasing the rate of output of m-sequences

DOI10.1016/0020-0190(94)00067-0zbMATH Open0797.94003OpenAlexW2054925253MaRDI QIDQ1332771FDOQ1332771

Authors: Simon R. Blackburn 

Publication date: 19 October 1994

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(94)00067-0

Recommendations

• Increasing the rate of output for m sequences
• Shift Register Sequences – A Retrospective Account
• Interlacing properties of shift-register sequences with generator polynomials irreducible over<tex>GF(p)</tex>(Corresp.)
• scientific article; zbMATH DE number 3912280
• An algorithm for generating \(M\)-sequences using the amalgamation-circles method in \(F_2\)

zbMATH Keywords

\(m\)-sequenceslinear shift register

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Increasing the rate of output for m sequences
• Interlacing properties of shift-register sequences with generator polynomials irreducible over<tex>GF(p)</tex>(Corresp.)
• High Speed Generation of Maximal Length Sequences

Cited In (2)

• Interlacing properties of shift-register sequences with generator polynomials irreducible over<tex>GF(p)</tex>(Corresp.)
• A new class of pseudo-random sequences from Mersenne numbers

This page was built for publication: Increasing the rate of output of \(m\)-sequences

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