The following pages link to (Q4208589):
Displaying 34 items.
- Linear complexity of Ding-Helleseth sequences of order 2 over \(\mathrm{GF}(l)\) (Q267793) (← links)
- Linear complexity and autocorrelation values of a polyphase generalized cyclotomic sequence of length \(pq\) (Q352022) (← links)
- The minimal polynomial of a sequence obtained from the componentwise linear transformation of a linear recurring sequence (Q410701) (← links)
- New classes of quaternary cyclotomic sequence of length \(2p^m\) with high linear complexity (Q456074) (← links)
- Linear complexity of binary generalized cyclotomic sequences over \(\mathrm{GF}(q)\) (Q491089) (← links)
- Linear complexity of binary cyclotomic sequences of order 6 (Q499975) (← links)
- A generalization of combinatorial designs and related codes (Q510407) (← links)
- Linear complexity and trace representation of quaternary sequences over \(\mathbb {Z}_{4}\) based on generalized cyclotomic classes modulo \( pq\) (Q517717) (← links)
- A note on cyclic almost difference families (Q533763) (← links)
- On the joint linear complexity profile of explicit inversive multisequences (Q558009) (← links)
- Partitioned difference families and almost difference sets (Q629130) (← links)
- Optimal difference systems of sets and partition-type cyclic difference packings (Q629935) (← links)
- About computation of the linear complexity of generalized cyclotomic sequences with period \(p^{n+1}\) (Q648068) (← links)
- The linear complexity of generalized cyclotomic sequences with period \(2p^n\) (Q742514) (← links)
- Linear complexity and correlation of a class of binary cyclotomic sequences (Q744013) (← links)
- The linear complexity of balanced quaternary sequences with optimal autocorrelation value (Q892508) (← links)
- Constructions of almost difference families (Q947817) (← links)
- On the linear complexity of Sidel'nikov sequences over nonprime fields (Q958251) (← links)
- Linear complexity of binary Whiteman generalized cyclotomic sequences of order \(2^k\) (Q1007906) (← links)
- Reducing the calculation of the linear complexity of \(u_2^v\)-periodic binary sequences to Games-Chan algorithm (Q1008964) (← links)
- Remarks on a cyclotomic sequence (Q1009130) (← links)
- Joint linear complexity of multisequences consisting of linear recurring sequences (Q1032485) (← links)
- How to determine linear complexity and \(k\)-error linear complexity in some classes of linear recurring sequences (Q1032492) (← links)
- Modified constructions of binary sequences using multiplicative inverse (Q1032814) (← links)
- Characterization of \(2^{n}\)-periodic binary sequences with fixed 2-error or 3-error linear complexity (Q1035809) (← links)
- The minimal polynomial over \(\mathbb F_q\) of linear recurring sequence over \(\mathbb F_{q^m}\) (Q1046471) (← links)
- Feedback shift registers, 2-adic span, and combiners with memory (Q1363072) (← links)
- On the distribution of the Diffie-Hellman pairs (Q1609391) (← links)
- On \(k\)-error linear complexity of pseudorandom binary sequences derived from Euler quotients (Q1620976) (← links)
- New generalized cyclotomic binary sequences of period \(p^2\) (Q1647562) (← links)
- On the linear complexity of Hall's sextic residue sequences over \(\mathrm{GF}(q)\) (Q1676992) (← links)
- Some new balanced and almost balanced quaternary sequences with low autocorrelation (Q1733974) (← links)
- A link between combinatorial designs and three-weight linear codes (Q1741922) (← links)
- Polynomials over base 2 finite fields with evenly distributed values (Q1779330) (← links)
