The linear complexity of generalized cyclotomic binary sequences of period \(p^n\)
From MaRDI portal
Publication:2414940
DOI10.1007/s10623-018-0513-2zbMath1480.94023MaRDI QIDQ2414940
Xiangyong Zeng, Vladimir Edemskiy, Tor Helleseth, Chunlei Li
Publication date: 17 May 2019
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10623-018-0513-2
05A18: Partitions of sets
94A55: Shift register sequences and sequences over finite alphabets in information and communication theory
94A60: Cryptography
Related Items
Linear Complexity of New q-ary Generalized Cyclotomic Sequences of Period $$2p^n$$, On the linear complexity and autocorrelation of generalized cyclotomic binary sequences with period \(4p^n \), Linear complexity of generalized cyclotomic sequences with period \(p^nq^m\), On \(k\)-error linear complexity of pseudorandom binary sequences derived from Euler quotients, On the properties of generalized cyclotomic binary sequences of period \(2p^m\), The estimate of the linear complexity of generalized cyclotomic binary and quaternary sequences with periods \(p^n\) and \(2p^n\), Linear complexity over \(\mathbb{F}_q\) and 2-adic complexity of a class of binary generalized cyclotomic sequences with good autocorrelation, Linear complexity of generalized cyclotomic sequences of period \(2p^m\)
Cites Work
- Cyclic codes from the second class two-prime Whiteman's generalized cyclotomic sequence with order 6
- About computation of the linear complexity of generalized cyclotomic sequences with period \(p^{n+1}\)
- New generalized cyclotomy and its applications
- On error linear complexity of new generalized cyclotomic binary sequences of period \(p^2\)
- 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\)
- A generalization of the Hall's sextic residue sequences
- Optimal Frequency Hopping Sequences of Odd Length
- A General Approach to Construction and Determination of the Linear Complexity of Sequences Based on Cosets
- Generalized cyclotomic codes of length p/sub 1//sup e(1)/...p/sub t//sup e(t)/
- Cyclotomic Constructions of Cyclic Codes With Length Being the Product of Two Primes
- A Unified Approach to Whiteman's and Ding-Helleseth's Generalized Cyclotomy Over Residue Class Rings
- A family of difference sets
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
