Greedy algorithms in coding theory

Gerard Cohen, Simon Litsyn, Gilles Zemor

Research output: Contribution to conferencePaperpeer-review

Abstract

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.

Original languageEnglish
Pages333-335
Number of pages3
StatePublished - 1996
Externally publishedYes
EventProceedings of the 1996 19th Convention of Electrical and Electronics Engineers in Israel - Jerusalem, Isr
Duration: 5 Nov 19966 Nov 1996

Conference

ConferenceProceedings of the 1996 19th Convention of Electrical and Electronics Engineers in Israel
CityJerusalem, Isr
Period5/11/966/11/96

Cite this