Coset weight enumerators of the extremal self-dual binary codes of length 32 (Q4276322)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 493079
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Coset weight enumerators of the extremal self-dual binary codes of length 32 |
scientific article; zbMATH DE number 493079 |
Statements
2 February 1994
0 references
regularity number
0 references
regularity matrix
0 references
coset weight enumerator
0 references
algorithm
0 references
partition design
0 references
extremal self-dual binary codes
0 references
0.8178415298461914
0 references
0.8169729709625244
0 references
0.8107367157936096
0 references
0.8056773543357849
0 references
Coset weight enumerators of the extremal self-dual binary codes of length 32 (English)
0 references
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].
0 references