We establish some necessary conditions for the existence of irreducible polynomials of
degree n and weight n over F2. Such polynomials can be used to efficiently implement
multiplication in F2n. We also provide a simple proof of a result of Bluher concerning the
reducibility of a certain family of polynomials.