Linear complexity of cyclotomic sequences of order six and BCH codes over \(\mathrm{GF}(3)\)
From MaRDI portal
Publication:476354
DOI10.3934/amc.2014.8.297zbMath1300.11126MaRDI QIDQ476354
Qin Yue, Liqin Hu, Feng Mei Liu
Publication date: 28 November 2014
Published in: Advances in Mathematics of Communications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3934/amc.2014.8.297
94A55: Shift register sequences and sequences over finite alphabets in information and communication theory
94A60: Cryptography
11T23: Exponential sums
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- About computation of the linear complexity of generalized cyclotomic sequences with period \(p^{n+1}\)
- Linear complexity of generalized cyclotomic binary sequences of order 2
- New generalized cyclotomy and its applications
- Cyclic codes from cyclotomic sequences of order four
- The cyclotomic numbers of order twelve
- Linear Complexity of New Generalized Cyclotomic Sequences of Order Two of Length<tex>$pq$</tex>
- On the linear complexity of binary sequences on the basis of biquadratic and sextic residue classes
- On the Autocorrelation and the Linear Complexity of q-Ary Prime n-Square Sequences
- On Cryptosystems Based on Polynomials and Finite Fields
- A class of balanced binary sequences with optimal autocorrelation properties
- Several classes of binary sequences with three-level autocorrelation
- New families of binary sequences with optimal three-level autocorrelation
- On the linear complexity of Hall's sextic residue sequences
- Pattern distributions of Legendre sequences
- Autocorrelation values of generalized cyclotomic sequences of order two
- The Weight Distribution of Some Irreducible Cyclic Codes
