Pages that link to "Item:Q4340323"
From MaRDI portal
The following pages link to Fast rational interpolation, Reed-Solomon decoding, and the linear complexity profiles of sequences (Q4340323):
Displaying 6 items.
- Polynomial-division-based algorithms for computing linear recurrence relations (Q820938) (← links)
- Fast algorithms for determining the linear complexities of sequences over \(GF(p^{m})\) with the period \(3 n\) (Q862718) (← links)
- Rational complexity of binary sequences, F\(\mathbb{Q}\)SRs, and pseudo-ultrametric continued fractions in \(\mathbb{R}\) (Q2130054) (← links)
- Recovering highly-complex linear recurrences of integer sequences (Q2398508) (← links)
- Generalized Rational Interpolation Over Commutative Rings and Remainder Decoding (Q3546496) (← links)
- Fast algorithm for computing the roots of error locator polynomials up to degree 11 in Reed-Solomon decoders (Q4552984) (← links)
