Estimating the size of correcting codes using extremal graph problems (Q3407619)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5677610
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Estimating the size of correcting codes using extremal graph problems |
scientific article; zbMATH DE number 5677610 |
Statements
Estimating the size of correcting codes using extremal graph problems (English)
0 references
4 March 2010
0 references
maximum independent set
0 references
graph coloring
0 references
error-correcting codes
0 references
coding theory
0 references
combinatorial optimization
0 references
0.726386308670044
0 references
0.7259559035301208
0 references
