The minimum number of minimal codewords in an \([n, k]\)-code and in graphic codes (Q2341750): Difference between revisions
From MaRDI portal
Changed an Item |
Created claim: Wikidata QID (P12): Q56926530, #quickstatements; #temporary_batch_1711439739529 |
||
(4 intermediate revisions by 3 users not shown) | |||
Property / describes a project that uses | |||
Property / describes a project that uses: nauty / rank | |||
Normal rank | |||
Property / describes a project that uses | |||
Property / describes a project that uses: Traces / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
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 |
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