Linear complexity and correlation of a class of binary cyclotomic sequences
From MaRDI portal
Publication:744013
DOI10.1007/S00200-014-0214-7zbMath1342.11094OpenAlexW2019741217MaRDI QIDQ744013
Publication date: 2 October 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-0214-7
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Sequences (mod (m)) (11B50) Cyclotomy (11T22)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Analysis and design of stream ciphers
- Linear complexity of generalized cyclotomic binary sequences of order 2
- New generalized cyclotomy and its applications
- On the linear complexity of generalized cyclotomic sequences with the period \(p^m\)
- Linear Complexity of New Generalized Cyclotomic Sequences of Order Two of Length<tex>$pq$</tex>
- Autocorrelation values of generalized cyclotomic sequences of order two
- Shift-register synthesis and BCH decoding
- A family of difference sets
This page was built for publication: Linear complexity and correlation of a class of binary cyclotomic sequences