On the number of minimal codewords in codes generated by the adjacency matrix of a graph (Q2065789): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 20:08, 1 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the number of minimal codewords in codes generated by the adjacency matrix of a graph |
scientific article |
Statements
On the number of minimal codewords in codes generated by the adjacency matrix of a graph (English)
0 references
13 January 2022
0 references
minimal codewords
0 references
graphs
0 references
linear codes
0 references
