Coset weight enumerators of the extremal self-dual binary codes of length 32

From MaRDI portal





The authors repeat the definitions of the notions: regularity number and regularity matrix of a code. Moreover they give a direct link between the regularity matrix and the coset weight enumerator in theorems 1 and 2. In theorem 3 an algorithm is given to compute the regularity matrix starting with some arbitrary partition design admitted by the code C. Proposition 1 shows how to obtain such a partition design from a subgroup of \(\text{GL}(k,2)\) acting transitively on the set of columns of the parity check matrix of the code. Finally the authors obtain the regularity matrices and coset weight enumerators of the extremal self-dual binary codes of length 32 by applying the above mentioned technique. For the entire collection see [Zbl 0780.00019].











This page was built for publication: Coset weight enumerators of the extremal self-dual binary codes of length 32

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