Pages that link to "Item:Q3548059"
From MaRDI portal
The following pages link to Reducing the Computation of Linear Complexities of Periodic Sequences Over ${\hbox {GF}}(p^m)$ (Q3548059):
Displaying 3 items.
- Reducing the calculation of the linear complexity of \(u_2^v\)-periodic binary sequences to Games-Chan algorithm (Q1008964) (← links)
- How to determine linear complexity and \(k\)-error linear complexity in some classes of linear recurring sequences (Q1032492) (← links)
- A formula on linear complexity of highest coordinate sequences from maximal periodic sequences over Galois rings (Q2478280) (← links)