Loading [a11y]/accessibility-menu.js
Weight enumerators of more irreducible cyclic binary codes | IEEE Journals & Magazine | IEEE Xplore

Weight enumerators of more irreducible cyclic binary codes


Abstract:

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.<>

Abstract:

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.<>
Published in: IEEE Transactions on Information Theory ( Volume: 39, Issue: 5, September 1993)
Page(s): 1701 - 1709
Date of Publication: 30 September 1993

ISSN Information:


References

References is not available for this document.