The following pages link to Primitive Binary Polynomials (Q4404996):
Displaying 10 items.
- Efficient calculation of the worst-case error and (fast) component-by-component construction of higher order polynomial lattice rules (Q664602) (← links)
- The least squares algorithm, parametric system identification and bounded noise (Q1314775) (← links)
- Small weight bases for Hamming codes (Q1391316) (← links)
- Maximum-length sequences, cellular automata, and random numbers (Q1821479) (← links)
- Polynomial pseudo-random number generator via cyclic phase (Q2271601) (← links)
- Primitive Polynomials Over Finite Fields (Q4032170) (← links)
- On the Periods of Generalized Fibonacci Recurrences (Q4305958) (← links)
- A construction of primitive polynomials over finite fields (Q4603778) (← links)
- A fast algorithm for testing reducibility of trinomials mod~2 and some new primitive trinomials of degree 3021377 (Q4806397) (← links)
- Small weight bases for hamming codes (Q6085712) (← links)
