Weight enumerators of more irreducible cyclic binary codes

The weight enumerators of all nondegenerate irreducible cyclic binary (n, k) codes have been computed for which k>27 and N=(2/sup k-1/)/n<500. The methods used are those developed by McEliece and further expanded by Ward and Segar (1986), using algebraic number theory and Stickelberger's theorem.<
>