Back to Search Start Over

Greedy and Heuristic algorithms for codes and colorings.

Authors :
Etzion, Tuvi
Ostergard, Patric R.J.
Source :
IEEE Transactions on Information Theory; Jan98, Vol. 44 Issue 1, p382, 7p, 4 Charts
Publication Year :
1998

Abstract

Presents the greedy and heuristic algorithms used in codes and coloring problems. Review of the partitioning methods for constant weight codes and asymmetric codes; Brief discussion of the main heuristic used; Methods that can be applied to further improve the outcomes of the algorithms.

Subjects

Subjects :
MATHEMATICS
ALGORITHMS
CODING theory
HEURISTIC
MATHEMATICAL models

Details

Language :
English
ISSN :
00189448
Volume :
44
Issue :
1
Database :
Complementary Index
Journal :
IEEE Transactions on Information Theory
Publication Type :
Academic Journal
Accession number :
70517
Full Text :
https://doi.org/10.1109/18.651069
Full Text Access
View/download PDF

Tools

Authors Abstract Subjects Details