The minimum number of minimal codewords in an \([n, k]\)-code and in graphic codes (Q2341750): Difference between revisions
From MaRDI portal
Set profile property. |
Created claim: Wikidata QID (P12): Q56926530, #quickstatements; #temporary_batch_1711439739529 |
||
| (One intermediate revision by one other user not shown) | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.dam.2014.11.015 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2058258197 / rank | |||
Normal rank | |||
| 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
