Pages that link to "Item:Q818141"
From MaRDI portal
The following pages link to On linear complexity of sequences over \(\text{GF}(2^n)\) (Q818141):
Displaying 5 items.
- The minimal polynomial of a sequence obtained from the componentwise linear transformation of a linear recurring sequence (Q410701) (← links)
- On the complexity of a family of \(k\)-context-free sequences (Q764304) (← links)
- On the linear complexity of some new \(q\)-ary sequences (Q942314) (← links)
- On the linear complexity of Hall's sextic residue sequences over \(\mathrm{GF}(q)\) (Q1676992) (← links)
- Linear recurring sequences and subfield subcodes of cyclic codes (Q2438537) (← links)