Greedy algorithms in coding theory
Gérard Cohen, Simon N. Litsyn, Gilles Zémor · 2002
A wide class of problems in coding theory are dealt with using a greedy algorithm due to Stein (1974) and Lovasz (1975). Some examples, including constructing covering codes, codes for conflict resolution, separating systems, source encoding with distortion, etc., are given a unified treatment.