A wide class of problems in coding theory are dealt with using a greedy algorithm due to Stein and Lovasz [15, 20]. Some examples, including constructing covering codes, codes for conflict resolution, separating systems, source encoding with distortion, etc., are given a unified treatment.
|Number of pages||3|
|State||Published - 1996|
|Event||Proceedings of the 1996 19th Convention of Electrical and Electronics Engineers in Israel - Jerusalem, Isr|
Duration: 5 Nov 1996 → 6 Nov 1996
|Conference||Proceedings of the 1996 19th Convention of Electrical and Electronics Engineers in Israel|
|Period||5/11/96 → 6/11/96|