Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

A note on greedy codes

From MaRDI portal
Publication:1924245
Jump to:navigation, search

DOI10.1006/jcta.1996.0096zbMath0869.94045OpenAlexW2044956065MaRDI QIDQ1924245

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

greedy algorithmGilbert-Varshamov boundGrundy functiongreedy codes


Mathematics Subject Classification ID

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


Related Items (1)

On the construction of linear \(q\)-ary lexicodes.




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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1924245&oldid=14351426"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 1 February 2024, at 16:02.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki