The maximum number of minimal codewords in an \([n,k]\)-code (Q389190)
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: The maximum number of minimal codewords in an \([n,k]\)-code |
scientific article; zbMATH DE number 6247650
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The maximum number of minimal codewords in an \([n,k]\)-code |
scientific article; zbMATH DE number 6247650 |
Statements
The maximum number of minimal codewords in an \([n,k]\)-code (English)
0 references
17 January 2014
0 references
minimal codewords
0 references
intersecting codes
0 references
matroid theory
0 references
cycle code of graphs
0 references
