Pages that link to "Item:Q3692884"
From MaRDI portal
The following pages link to Shift Register Synthesis (Modulo <i>m</i>) (Q3692884):
Displaying 18 items.
- An iterative algorithm for parametrization of shortest length linear shift registers over finite chain rings (Q522204) (← links)
- On efficient sparse integer matrix Smith normal form computations (Q597114) (← links)
- Minimal Gröbner bases and the predictable leading monomial property (Q609485) (← links)
- A linear algebraic approach to multisequence shift-register synthesis (Q764390) (← links)
- On linear complexity of sequences over \(\text{GF}(2^n)\) (Q818141) (← links)
- Two-dimensional shift register synthesis and Gröbner bases for polynomial ideals over an integer residue ring (Q1180162) (← links)
- Construction and decoding of BCH codes over finite commutative rings (Q1301272) (← links)
- Transform domain characterization of cyclic codes over \(\mathbb{Z}_ m\) (Q1328436) (← links)
- Injectivity on distribution of elements in the compressed sequences derived from primitive sequences over \(\mathbb {Z}_{p^{e}}\) (Q1733973) (← links)
- Linear recurring sequences over rings and modules (Q1915326) (← links)
- About the linear complexity of quaternary sequences with even length (Q2202912) (← links)
- Recovering highly-complex linear recurrences of integer sequences (Q2398508) (← links)
- An improved method for predicting truncated multiple recursive generators with unknown parameters (Q2701486) (← links)
- TWOPRIME: A fast stream ciphering algorithm (Q4639329) (← links)
- Transform decoding of BCH codes over<i>Z<sub>m</sub></i> (Q4764222) (← links)
- Shift-register synthesis and BCH decoding (Q5554046) (← links)
- Linear complexity and trace representation of balanced quaternary cyclotomic sequences of prime period \(p\) (Q6086193) (← links)
- Extensions and limits of the Specker-Blatter theorem (Q6642890) (← links)
