Progress Report of Greedy Algorithms in Coding theory
Date Issued
2013
Author(s)
Abstract
Greedy algorithms in Coding Theory are simple to define
and easy to implement, but require exponential running time.
Codes obtained with greedy constructions have very good
parameters, thus improving the running time of these
algorithms may lead to discovery of new codes with best
known parameters. We give an overview of greedy
algorithms and discuss further improvements.
