A note on greedy codes
type: Item
instance of: scholarly article
title: A note on greedy codes
zbMATH Open document ID: 0869.94045
author: Dmitry G. Fon-Der-Flaass
published in: Journal of Combinatorial Theory. Series A
publication date: 1999-07-28T00:00:00Z
review text: 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.
reviewed by: L. M. G. M. Tolhuizen
Mathematics Subject Classification ID: 94B60
Mathematics Subject Classification ID: 94B25
Mathematics Subject Classification ID: 94B05
Mathematics Subject Classification ID: 91A05
zbMATH DE Number: 934999
zbMATH Keywords: greedy codes
zbMATH Keywords: greedy algorithm
zbMATH Keywords: Grundy function
zbMATH Keywords: Gilbert-Varshamov bound
MaRDI profile type: Publication
full work available at URL: jcta.1996.0096
OpenAlex ID: W2044956065
DOI: 10.1006/JCTA.1996.0096
description: scientific article; zbMATH DE number 934999