About computation of the linear complexity of generalized cyclotomic sequences with period p^n+1
From MaRDI portal
Publication:648068
Recommendations
- The linear complexity of generalized cyclotomic sequences with period \(2p^n\)
- Linear complexity of generalized cyclotomic sequences with period 2ᵐp^n
- Linear complexity of generalized cyclotomic sequences of period \(2p^m\)
- Linear complexity of generalized cyclotomic binary sequences of length \(2p^{m}\)
- On the linear complexity of generalized cyclotomic sequences with the period \(p^m\)
Cites work
- scientific article; zbMATH DE number 3756556 (Why is no real title available?)
- scientific article; zbMATH DE number 1196713 (Why is no real title available?)
- scientific article; zbMATH DE number 1182117 (Why is no real title available?)
- Linear Complexity and Autocorrelation of Prime Cube Sequences
- Linear Complexity of Some Generalized Cyclotomic Sequences
- Linear complexity of ternary sequences formed on the basis of power residue classes
- New generalized cyclotomy and its applications
- New self-dual codes over GF(4) with the highest known minimum weights
- On the linear complexity of binary sequences on the basis of biquadratic and sextic residue classes
- On the linear complexity of generalized cyclotomic sequences with the period \(p^m\)
- ON THE LINEAR COMPLEXITY OF SOME GENERALIZED CYCLOTOMIC SEQUENCES
- Several classes of binary sequences with three-level autocorrelation
Cited in
(23)- On the linear complexity of Hall's sextic residue sequences over \(\mathrm{GF}(q)\)
- On the linear complexity and the autocorrelation of generalized cyclotomic binary sequences of length \(2p^m\)
- A further study of the linear complexity of new binary cyclotomic sequence of length \(p^r\)
- Autocorrelation and linear complexity of binary generalized cyclotomic sequences with period \(pq\)
- The estimate of the linear complexity of generalized cyclotomic binary and quaternary sequences with periods p^n and 2p^n
- A kind of quaternary sequences of period \(2 p^m q^n\) and their linear complexity
- Linear complexity of generalized cyclotomic sequences of order 4 over \(\mathbb{F}_l\)
- Linear complexity of generalized sequences by comparison of PN-sequences
- Linear complexity of generalized cyclotomic sequences of period \(2p^m\)
- Design sequences with high linear complexity over finite fields using generalized cyclotomy
- The linear complexity of generalized cyclotomic binary sequences of period p^n
- On the linear complexity of binary sequences on the basis of biquadratic and sextic residue classes
- New classes of quaternary cyclotomic sequence of length \(2p^m\) with high linear complexity
- Linear complexity of cyclotomic sequences of order six and BCH codes over \(\mathrm{GF}(3)\)
- The linear complexity of a class of binary sequences with period \(2p\)
- Linear complexity of new q-ary generalized cyclotomic sequences of period 2p^n
- Linear complexity of generalized cyclotomic sequences with period 2ᵐp^n
- scientific article; zbMATH DE number 6263964 (Why is no real title available?)
- On the linear complexity and autocorrelation of generalized cyclotomic binary sequences with period 4p^n
- The linear complexity and 4-adic complexity of quaternary sequences with period pq
- Trace representation of a family of generalized cyclotomic binary sequences with period p^n
- Linear complexity of ternary sequences formed on the basis of power residue classes
- The linear complexity of generalized cyclotomic sequences with period \(2p^n\)
This page was built for publication: About computation of the linear complexity of generalized cyclotomic sequences with period \(p^{n+1}\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q648068)
