Pages that link to "Item:Q764390"
From MaRDI portal
The following pages link to A linear algebraic approach to multisequence shift-register synthesis (Q764390):
Displaying 12 items.
- Determining the \(k\)-error joint linear complexity spectrum for a binary multisequence with period \(p^n\) (Q301631) (← links)
- Row reduction applied to decoding of rank-metric and subspace codes (Q510489) (← links)
- An iterative algorithm for parametrization of shortest length linear shift registers over finite chain rings (Q522204) (← links)
- Fast multi-sequence shift-register synthesis with the Euclidean algorithm (Q660086) (← links)
- \(F[x]\)-lattice basis reduction algorithm and multisequence synthesis (Q865955) (← links)
- Power decoding Reed-Solomon codes up to the Johnson radius (Q1783708) (← links)
- Linear feedback shift registers and the minimal realization problem (Q2002558) (← links)
- Applying a generalized allocation scheme to analyzing a class of sequences generated by a shift register (Q2314207) (← links)
- Fast skew-feedback shift-register synthesis (Q2436582) (← links)
- Algebraic Shift Register Sequences (Q3117192) (← links)
- Shift Register Synthesis (Modulo <i>m</i>) (Q3692884) (← links)
- (Q3783203) (← links)
