A note on greedy codes (Q1924245): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1006/jcta.1996.0096 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2044956065 / rank | |||
Normal rank | |||
Latest revision as of 19:32, 19 March 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
