Linear inequalities for covering codes. I. Pair covering inequalities (Q3358649): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 16:09, 4 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Linear inequalities for covering codes. I. Pair covering inequalities |
scientific article |
Statements
Linear inequalities for covering codes. I. Pair covering inequalities (English)
0 references
1991
0 references
linear inequality
0 references
covering radius
0 references
Hamming association scheme
0 references
lower bounds
0 references
