An efficient algorithm for software generation of binary linear recurrences

DOI10.1007/S00200-004-0147-7MaRDI QIDQ1762549zbMATH OpenOpenAlexFDO

Authors Sanjay Burman, Palash Sarkar

Publication date 9 February 2005

Published in Applicable Algebra in Engineering, Communication and Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00200-004-0147-7

zbMATH Keywords

LFSRLinear feedback shift registerLinear binary recurrence

Mathematics Subject Classification ID

Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Density, gaps, topology (11B05) General topics in the theory of algorithms (68W01)

Recommendations

• scientific article; zbMATH DE number 4195879
• Algorithm for the generation of nonlinear de Bruijn sequences
• A fast algorithm for determining the linear complexity of a binary sequence with period 2ⁿp^m
• Efficient jump ahead for \(\mathbb{F}_{2}\)-linear random number generators
• scientific article; zbMATH DE number 653399

Cites work

• scientific article; zbMATH DE number 4110778 (Why is no real title available?)
• scientific article; zbMATH DE number 3573250 (Why is no real title available?)
• scientific article; zbMATH DE number 607286 (Why is no real title available?)
• scientific article; zbMATH DE number 954401 (Why is no real title available?)
• Shift Register Sequences – A Retrospective Account

Cited in

(1)

• Efficient generation of binary words of given weight

This page was built for publication: An efficient algorithm for software generation of binary linear recurrences

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