A note on greedy codes (Q1924245)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A note on greedy codes |
scientific article; zbMATH DE number 934999
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A note on greedy codes |
scientific article; zbMATH DE number 934999 |
Statements
A note on greedy codes (English)
0 references
28 July 1999
0 references
Binary codes obtained by a greedy algorithm are related to the set of winning positions of a two-persons game. By studying the Grundy function of this game, the author gives an alternative proof for the linearity of Greedy codes and shows that these codes attain the Gilbert-Varshamov bound.
0 references
greedy codes
0 references
greedy algorithm
0 references
Grundy function
0 references
Gilbert-Varshamov bound
0 references
