The linear complexity of generalized cyclotomic sequences with period \(2p^n\)
From MaRDI portal
Publication:742514
DOI10.1007/s00200-014-0223-6zbMath1384.11031OpenAlexW1214756888MaRDI QIDQ742514
Olga Antonova, Vladimir Edemskiy
Publication date: 18 September 2014
Published in: Applicable Algebra in Engineering, Communication and Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00200-014-0223-6
Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Cryptography (94A60) Number-theoretic algorithms; complexity (11Y16) Sequences (mod (m)) (11B50)
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\)
Cites Work
- About computation of the linear complexity of generalized cyclotomic sequences with period \(p^{n+1}\)
- Linear complexity of generalized cyclotomic binary sequences of length \(2p^{m}\)
- New generalized cyclotomy and its applications
- Remarks on the generalized cyclotomic sequences of length \(2p^m\)
- On the linear complexity and the autocorrelation of generalized cyclotomic binary sequences of length \(2p^m\)
- 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
- New families of binary sequences with optimal three-level autocorrelation
- Cyclotomy and duadic codes of prime lengths
- Generalized cyclotomic codes of length p/sub 1//sup e(1)/...p/sub t//sup e(t)/
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: The linear complexity of generalized cyclotomic sequences with period \(2p^n\)
