Linear recursion properties of uncorrelated binary sequences

DOI10.1016/0166-218X(90)90064-JzbMATH Open0728.05013OpenAlexW2013117294MaRDI QIDQ804580FDOQ804580

Authors: A. J. Bromfield, Fred C. Piper 

Publication date: 1990

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0166-218x(90)90064-j

Recommendations

• Pseudorandomness of binary sequences derived from linear recursions
• scientific article; zbMATH DE number 5150220
• On linear recursion and pseudorandomness
• scientific article; zbMATH DE number 26870
• scientific article; zbMATH DE number 4055528

zbMATH Keywords

Hadamard difference setsfinite sequencelinear complexity of uncorrelated sequences

Mathematics Subject Classification ID

Combinatorial aspects of difference sets (number-theoretic, group-theoretic, etc.) (05B10)

Cites Work

• Linear Complexity and Random Sequences
• Title not available (Why is that?)
• Cyclic difference sets
• Title not available (Why is that?)
• On the classification of balanced binary sequences of period<tex>2^n-1</tex>(Corresp.)
• Linear recursion properties of uncorrelated binary sequences

Cited In (5)

• Balance and pattern distribution of sequences derived from pseudorandom subsets of \(\mathbb{Z}_q\)
• The relation between autocorrelation and run-length of binary sequences
• On the \(k\)-error linear complexity of binary sequences derived from the discrete logarithm in finite fields
• Linear recursion properties of uncorrelated binary sequences
• Title not available (Why is that?)

This page was built for publication: Linear recursion properties of uncorrelated binary sequences

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