A note on greedy codes

DOI10.1006/JCTA.1996.0096MaRDI QIDQ1924245zbMATH OpenOpenAlexFDO

Authors Dmitry G. Fon-Der-Flaass

Publication date 28 July 1999

Published in Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1006/jcta.1996.0096

zbMATH Keywords

Gilbert-Varshamov boundgreedy algorithmgreedy codesGrundy function

Mathematics Subject Classification ID

2-person games (91A05) Linear codes (general theory) (94B05) Combinatorial codes (94B25) Other types of codes (94B60)

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.

Recommendations

• Publication:4886133
• Greedy codes
• Self-orthogonal greedy codes

Cited in

(11)

• Forcing linearity on greedy codes
• Self-orthogonal greedy codes
• On zero-error codes produced by greedy algorithms
• On the construction of linear \(q\)-ary lexicodes.
• scientific article; zbMATH DE number 988847 (Why is no real title available?)
• On greedy algorithms in coding theory
• scientific article; zbMATH DE number 1894904 (Why is no real title available?)
• scientific article; zbMATH DE number 841643 (Why is no real title available?)
• scientific article; zbMATH DE number 910956 (Why is no real title available?)
• scientific article; zbMATH DE number 969100 (Why is no real title available?)
• Greedy codes

This page was built for publication: A note on greedy codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1924245)