On designs and formally self-dual codes (Q1321556)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On designs and formally self-dual codes |
scientific article; zbMATH DE number 558469
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On designs and formally self-dual codes |
scientific article; zbMATH DE number 558469 |
Statements
On designs and formally self-dual codes (English)
0 references
28 April 1994
0 references
A code \(C\) is formally self-dual if \(C\) has the same weight distribution as its dual code \(C^ \perp\). The authors study binary formally self- dual codes and demonstrate that the class of such codes contains codes that have greater minimum distance than any self-dual code with the same parameters. A strengthening of the Assmus-Mattson theorem that yields designs formed by words in \(C\cup C^ \perp\) is proved.
0 references
binary formally self-dual codes
0 references
minimum distance
0 references
Assmus-Mattson theorem
0 references
designs
0 references
