Divisible codes

From MaRDI portal





A divisible code is a linear code whose words all have weights divisible by some constant larger than one. Certain divisible codes have been conspicuous lately as self-dual codes. The recent survey article by \textit{N. J. A. Sloane} [Proc. Symp. Pure Math. 34, 273--306 (1979; Zbl 0407.94009)] indicates why self-dual codes are so interesting and provides an extensive bibliography. Their study begins with a theorem of Gleason and Pierce giving constraints on the divisor and field size for divisible codes that are formally self-dual in the sense of having the same weight enumerator as their orthogonals. These codes can also be viewed as divisible codes having the largest conceivable dimension for their length (except when the field size and divisor are both 2). The first result of the present paper is a recasting of the Gleason-Pierce theorem from this standpoint. It is proved by elementary considerations that lead to another recast theorem extending one of \textit{F. J. MacWilliams} on the equivalence of irreducible binary cyclic codes of odd length [Bell Syst. Tech. J. 44, 303--332 (1965; Zbl 0132.39902)].




Cited in
(30)








This page was built for publication: Divisible codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1142197)