Title :
Weight enumerators of more irreducible cyclic binary codes
fDate :
9/1/1993 12:00:00 AM
Abstract :
The weight enumerators of all nondegenerate irreducible cyclic binary (n, k) codes have been computed for which k>27 and N=(2k-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
Keywords :
cyclic codes; number theory; Stickelberger´s theorem; algebraic number theory; irreducible cyclic binary codes; nondegenerate codes; weight enumerators; Binary codes; Error correction codes; Jacobian matrices; Lattices; National security; Polynomials; Protection; US Government;
Journal_Title :
Information Theory, IEEE Transactions on
