The minimum number of minimal codewords in an \([n, k]\)-code and in graphic codes (Q2341750): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Removed claims |
||
| Property / author | |||
| Property / author: Q1932462 / rank | |||
| Property / author | |||
| Property / author: R. E. L. Aldred / rank | |||
| Property / author | |||
| Property / author: Q1932463 / rank | |||
| Property / author | |||
| Property / author: Seongmin Ok / rank | |||
Revision as of 12:59, 10 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The minimum number of minimal codewords in an \([n, k]\)-code and in graphic codes |
scientific article |
Statements
The minimum number of minimal codewords in an \([n, k]\)-code and in graphic codes (English)
0 references
28 April 2015
0 references
minimal codewords
0 references
matroid theory
0 references
cycle code of graphs
0 references
