Linear complexity of ternary sequences formed on the basis of power residue classes
From MaRDI portal
(Redirected from Publication:734266)
Recommendations
- On the linear complexity of binary sequences on the basis of biquadratic and sextic residue classes
- Linear Complexity over F p of Ternary Sidel’nikov Sequences
- On the linear complexity of Hall's sextic residue sequences
- About computation of the linear complexity of generalized cyclotomic sequences with period \(p^{n+1}\)
- The linear complexity of generalized cyclotomic sequences with period \(2p^n\)
Cites work
- scientific article; zbMATH DE number 3882549 (Why is no real title available?)
- scientific article; zbMATH DE number 3756556 (Why is no real title available?)
- scientific article; zbMATH DE number 1182117 (Why is no real title available?)
- Linear Complexity over F p of Ternary Sidel’nikov Sequences
- New self-dual codes over GF(4) with the highest known minimum weights
- Public-key cryptosystems based on cubic finite field extensions
Cited in
(7)- On the linear complexity of Ding-Helleseth generalized cyclotomic binary sequences of order four and six
- On the linear complexity of binary sequences on the basis of biquadratic and sextic residue classes
- A linear complexity analysis of quadratic residues and primitive roots spacings
- Regularity versus complexity in the binary representation of 3ⁿ
- Trace Representation and Linear Complexity of Binary eth Power Residue Sequences of Period p
- About computation of the linear complexity of generalized cyclotomic sequences with period \(p^{n+1}\)
- Structure and linear time recognition of 3-leaf powers
This page was built for publication: Linear complexity of ternary sequences formed on the basis of power residue classes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q734266)
