Name
Abstract | ||
|---|---|---|
Many of the fundamental coding problems can be represented as graph problems. These problems are often intrinsically difficult and unsolved even if the code length is relatively small. With the motivation to improve lower bounds on the sizes of constant weight codes and asymmetric codes, we suggest a few greedy algorithms and other heuristic methods, which result in new, record-breaking codes. Some of the heuristics used are based on tabu search and evolutionary algorithms. Tables of new codes are presented |
Year | DOI | Venue |
|---|---|---|
1998 | 10.1109/18.651069 | IEEE Transactions on Information Theory |
Keywords | Field | DocType |
codes,graph theory,search problems,asymmetric codes,code length,code size,colorings,constant weight codes,evolutionary algorithms,graph problems,greedy algorithms,heuristic algorithms,heuristic methods,lower bounds,minimum Hamming distance,minimum asymmetric distance,tabu search | Graph theory,Discrete mathematics,Combinatorics,Heuristic,Evolutionary algorithm,Constant-weight code,Computer science,Block code,Algorithm,Greedy algorithm,Heuristics,Tabu search | Journal |
Volume | Issue | ISSN |
44 | 1 | 0018-9448 |
Citations | PageRank | References |
11 | 0.78 | 13 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| T. Etzion | 1 | 364 | 35.77 |
| Patric R. J. Östergård | 2 | 92 | 12.09 |