On greedy algorithms in coding theory

On greedy algorithms in coding theory

We study a wide class of problems in coding theory for which we consider two different formulations: in terms of incidence matrices and in terms of hypergraphs. These problems are dealt with using a greedy algorithm due to Stein (1974) and Lovasz (1975). Some examples, including constructing coverin...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:IEEE transactions on information theory 1996-11, Vol.42 (6), p.2053-2057
Hauptverfasser: Cohen, G.D., Litsyn, S., Zemor, C.
Format: Artikel
Sprache:eng
Schlagworte:
Algorithms
Automata
Codes
Cryptography
Decoding
Greedy algorithms
Information technology
Information theory
Linear code
Quantization
Rate distortion theory
Testing
Theory
Upper bound
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:We study a wide class of problems in coding theory for which we consider two different formulations: in terms of incidence matrices and in terms of hypergraphs. These problems 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. Under certain conditions derandomization can be performed, leading to an essential reduction in the complexity of the constructions.
ISSN:0018-9448
1557-9654
DOI:10.1109/18.556707