A note on greedy codes (Q1924245): 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:02, 1 February 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A note on greedy codes |
scientific article |
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