On linear complexity of sequences over GF(2ⁿ)
DOI10.1016/J.TCS.2005.11.044zbMATH Open1138.94009OpenAlexW1966045745MaRDI QIDQ818141FDOQ818141
Authors: Guang Gong, A. M. Youssef 
Publication date: 24 March 2006
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2005.11.044
Recommendations
- Reducing the Computation of Linear Complexities of Periodic Sequences Over ${\hbox {GF}}(p^m)$
- Linear complexity of binary generalized cyclotomic sequences over \(\mathrm{GF}(q)\)
- On the Linear Complexity of Combined Shift Register Sequences
- Linear complexity of a class of pseudorandom sequences over a general finite field
- A relationship between linear complexity and k-error linear complexity
Data encryption (aspects in computer science) (68P25) Cryptography (94A60) Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Polynomials over finite fields (11T06) Number-theoretic algorithms; complexity (11Y16)
Cites Work
Cited In (5)
- Linear recurring sequences and subfield subcodes of cyclic codes
- On the complexity of a family of \(k\)-context-free sequences
- On the linear complexity of Hall's sextic residue sequences over \(\mathrm{GF}(q)\)
- The minimal polynomial of a sequence obtained from the componentwise linear transformation of a linear recurring sequence
- On the linear complexity of some new \(q\)-ary sequences
This page was built for publication: On linear complexity of sequences over \(\text{GF}(2^n)\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q818141)
