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