The minimum number of minimal codewords in an \([n, k]\)-code and in graphic codes (Q2341750): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
Created claim: Wikidata QID (P12): Q56926530, #quickstatements; #temporary_batch_1711439739529 |
||
Property / Wikidata QID | |||
Property / Wikidata QID: Q56926530 / rank | |||
Normal rank |
Latest revision as of 11:14, 26 March 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