How do I find primitive polynomials for n > 16?
I use matlabs primpoly(n,’all’) to find masks for Galois LFSR random number generators. But the primpoly function tops out at n=16. Is there an equivalent function for arbitrarily large n?I use matlabs primpoly(n,’all’) to find masks for Galois LFSR random number generators. But the primpoly function tops out at n=16. Is there an equivalent function for arbitrarily large n? I use matlabs primpoly(n,’all’) to find masks for Galois LFSR random number generators. But the primpoly function tops out at n=16. Is there an equivalent function for arbitrarily large n? primpoly, galois, lfsr MATLAB Answers — New Questions
16?” />
