On linear complexity of binary lattices. II
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3081798 (Why is no real title available?)
- An algorithm for the k-error linear complexity of binary sequences with period 2/sup n/
- Linear complexity and related complexity measures
- Measures of pseudorandomness of binary lattices. III: \(Q_k\), correlation, normality, minimal values)
- Measures of pseudorandomness of families of binary lattices. I: Definitions, a construction using quadratic characters
- Measures of pseudorandomness of families of binary lattices. II: A further construction
- On finite pseudorandom binary sequences I: Measure of pseudorandomness, the Legendre symbol
- On pseudorandom binary lattices
- On the k-error linear complexity of cyclotomic sequences
- On the linear complexity of binary lattices
Cited in
(8)- scientific article; zbMATH DE number 6292594 (Why is no real title available?)
- Enumeration results on linear complexity profiles and lattice profiles
- Multidimensional linear complexity analysis of periodic arrays
- On the linear complexity for multidimensional sequences
- On the trellis complexity of root lattices and their duals
- On finite pseudorandom binary lattices
- Tight lower bounds for linear \(2\)-query LCCs over finite fields. With an appendix by Sergey Yekhanin.
- On the linear complexity of binary lattices
This page was built for publication: On linear complexity of binary lattices. II
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q457014)
