Pages that link to "Item:Q3546689"
From MaRDI portal
The following pages link to Fast Algorithms for Determining the Linear Complexity of Sequences Over<tex>$hboxGF,(p^m)$</tex>With Period<tex>$2^tn$</tex> (Q3546689):
Displaying 4 items.
- Fast algorithms for determining the linear complexities of sequences over \(GF(p^{m})\) with the period \(3 n\) (Q862718) (← links)
- 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)
- Quadratic functions with prescribed spectra (Q1934217) (← links)
