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. |
Set OpenAlex properties. |
||
| 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 | |||
Revision as of 22:02, 19 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
