DocumentCode
1669178
Title
Greedy algorithms in coding theory
Author
Cohen, Gerard ; Litsyn, Simon ; Zémor, Gilles
Author_Institution
ENST, Paris, France
fYear
1996
Firstpage
333
Lastpage
335
Abstract
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
Keywords
encoding; matrix algebra; coding theory; conflict resolution; covering codes; distortion; greedy algorithm; separating systems; source encoding; Automata; Codes; Cryptography; Greedy algorithms; Labeling; Symmetric matrices; Testing; Tiles;
fLanguage
English
Publisher
ieee
Conference_Titel
Electrical and Electronics Engineers in Israel, 1996., Nineteenth Convention of
Conference_Location
Jerusalem
Print_ISBN
0-7803-3330-6
Type
conf
DOI
10.1109/EEIS.1996.566963
Filename
566963
Link To Document