Linear complexity profile and correlation measure of interleaved sequences
From MaRDI portal
Recommendations
- Linear complexity profile of \(m\)-ary pseudorandom sequences with small correlation measure
- Sequences with good correlation property based on depth and interleaving techniques
- Linear complexity profile of binary sequences with small correlation measure
- Notes on \(q\)-ary interleaved sequences
- scientific article; zbMATH DE number 5150220
Cites work
- Cryptographic applications of analytic number theory. Complexity lower bounds and pseudo\-randomness
- scientific article; zbMATH DE number 5831618 (Why is no real title available?)
- scientific article; zbMATH DE number 2238187 (Why is no real title available?)
- Linear complexity profile of \(m\)-ary pseudorandom sequences with small correlation measure
- Linear complexity profile of binary sequences with small correlation measure
- Measures of pseudorandomness
- New designs for signal sets with low cross correlation, balance property, and large linear span: GF(p) case
- On finite pseudorandom binary sequences I: Measure of pseudorandomness, the Legendre symbol
- On finite pseudorandom sequences of k symbols.
- Theory and applications of q-ary interleaved sequences
Cited in
(3)
This page was built for publication: Linear complexity profile and correlation measure of interleaved sequences
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q892510)