About computation of the linear complexity of generalized cyclotomic sequences with period p^n+1
From MaRDI portal
Publication:648068
DOI10.1007/S10623-010-9474-9zbMATH Open1241.11141OpenAlexW2004425646MaRDI QIDQ648068FDOQ648068
Authors: Vladimir Edemskiy 
Publication date: 22 November 2011
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10623-010-9474-9
Recommendations
- The linear complexity of generalized cyclotomic sequences with period \(2p^n\)
- Linear complexity of generalized cyclotomic sequences with period \(2^mp^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\)
Cryptography (94A60) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Number-theoretic algorithms; complexity (11Y16) Cyclotomy (11T22)
Cites Work
- New generalized cyclotomy and its applications
- On the linear complexity of binary sequences on the basis of biquadratic and sextic residue classes
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the linear complexity of generalized cyclotomic sequences with the period \(p^m\)
- Linear Complexity of Some Generalized Cyclotomic Sequences
- Title not available (Why is that?)
- Several classes of binary sequences with three-level autocorrelation
- Linear Complexity and Autocorrelation of Prime Cube Sequences
- New self-dual codes over GF(4) with the highest known minimum weights
- ON THE LINEAR COMPLEXITY OF SOME GENERALIZED CYCLOTOMIC SEQUENCES
- Linear complexity of ternary sequences formed on the basis of power residue classes
Cited In (22)
- Design sequences with high linear complexity over finite fields using generalized cyclotomy
- On the linear complexity and the autocorrelation of generalized cyclotomic binary sequences of length \(2p^m\)
- Title not available (Why is that?)
- The linear complexity of generalized cyclotomic binary sequences of period \(p^n\)
- The linear complexity and 4-adic complexity of quaternary sequences with period \(pq\)
- The linear complexity of generalized cyclotomic sequences with period \(2p^n\)
- New classes of quaternary cyclotomic sequence of length \(2p^m\) with high linear complexity
- On the linear complexity and autocorrelation of generalized cyclotomic binary sequences with period \(4p^n \)
- Linear complexity of cyclotomic sequences of order six and BCH codes over \(\mathrm{GF}(3)\)
- On the linear complexity of Hall's sextic residue sequences over \(\mathrm{GF}(q)\)
- Linear complexity of generalized cyclotomic sequences of order 4 over \(\mathbb{F}_l\)
- Linear complexity of generalized cyclotomic sequences with period \(2^mp^n\)
- Linear complexity of generalized sequences by comparison of PN-sequences
- Autocorrelation and linear complexity of binary generalized cyclotomic sequences with period \(pq\)
- Linear complexity of ternary sequences formed on the basis of power residue classes
- Linear complexity of generalized cyclotomic sequences of period \(2p^m\)
- 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\)
- A further study of the linear complexity of new binary cyclotomic sequence of length \(p^r\)
- On the linear complexity of binary sequences on the basis of biquadratic and sextic residue classes
- 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
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)
