Coset weight enumerators of the extremal self-dual binary codes of length 32
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].
- The binary extremal self-dual codes of lengths 38 and 40
- An enumeration of binary self-dual codes of length 32
- Extremal binary self-dual codes
- New extremal self-dual codes of lengths 36 and 38
- On the Complete Coset Weight Distribution of the Extremal Self-Dual<tex>$[46, 23, 10]$</tex>Code
- Self-dual codes which are principal ideals of the group algebra \(\mathbb{F}_ 2[\{\mathbb{F}_{2^ m},+\}]\)
- On \(s\)-extremal singly even self-dual \([24k+8,12k+4,4k+2]\) codes
- On covering radii and coset weight distributions of extremal binary self-dual codes of length 56
- The complete coset weight enumerator of the linear octonary code
- The third support weight enumerators of the doubly-even, self-dual [32, 16, 8] codes
- scientific article; zbMATH DE number 5175633 (Why is no real title available?)
- The divisibility modulo 24 of Kloosterman sums on \(\text{GF}(2^m)\), \(m\) odd
- Completely regular codes and completely transitive codes
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)