The maximum number of minimal codewords in an \([n,k]\)-code (Q389190)
From MaRDI portal
!
WARNING
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 6247650
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0.859489917755127
0 references
0.8561305403709412
0 references
0.8544608354568481
0 references
0.8038387894630432
0 references
0.7980193495750427
0 references
