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-9zbMath1241.11141OpenAlexW2004425646MaRDI QIDQ648068
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
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60) Number-theoretic algorithms; complexity (11Y16) Cyclotomy (11T22)
Related Items
Linear Complexity of New q-ary Generalized Cyclotomic Sequences of Period $$2p^n$$ ⋮ The estimate of the linear complexity of generalized cyclotomic binary and quaternary sequences with periods \(p^n\) and \(2p^n\) ⋮ Design sequences with high linear complexity over finite fields using generalized cyclotomy ⋮ 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\) ⋮ On the linear complexity of Hall's sextic residue sequences over \(\mathrm{GF}(q)\) ⋮ The linear complexity of generalized cyclotomic binary sequences of period \(p^n\) ⋮ 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\) ⋮ On the linear complexity and the autocorrelation of generalized cyclotomic binary sequences of length \(2p^m\) ⋮ 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\) ⋮ 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 linear complexity of generalized cyclotomic sequences with period \(2p^n\) ⋮ Linear complexity of generalized cyclotomic sequences of period \(2p^m\) ⋮ Unnamed Item
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Linear complexity of ternary sequences formed on the basis of power residue classes
- New generalized cyclotomy and its applications
- On the linear complexity of generalized cyclotomic sequences with the period \(p^m\)
- On the linear complexity of binary sequences on the basis of biquadratic and sextic residue classes
- Several classes of binary sequences with three-level autocorrelation
- New self-dual codes over GF(4) with the highest known minimum weights
- Linear Complexity of Some Generalized Cyclotomic Sequences
- ON THE LINEAR COMPLEXITY OF SOME GENERALIZED CYCLOTOMIC SEQUENCES
- Linear Complexity and Autocorrelation of Prime Cube Sequences
