A Fast Algorithm To Compute Irreducible and Primitive Polynomials in Finite Fields (bibtex)
by Rifà, Josep and Borrell, Joan
Reference:
A Fast Algorithm To Compute Irreducible and Primitive Polynomials in Finite Fields (Rifà, Josep and Borrell, Joan), In Mathematical Systems Theory, volume 28, 1995.
Bibtex Entry:
@article{rifa_fast_1995,
	title = {A {Fast} {Algorithm} {To} {Compute} {Irreducible} and {Primitive} {Polynomials} in {Finite} {Fields}},
	volume = {28},
	url = {https://doi.org/10.1007/BF01294593},
	doi = {10.1007/BF01294593},
	number = {1},
	journal = {Mathematical Systems Theory},
	author = {Rifà, Josep and Borrell, Joan},
	year = {1995},
	pages = {13--20}
}
Powered by bibtexbrowser