Greedy and heuristic algorithms for codes and colorings

IEEE Transactions on Information Theory

Volumn 44, Issue 1, 1998, Pages 382-388

  Etzion, Tuvi ^a,b  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

^b AALTO UNIVERSITY   (Finland)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; GRAPH THEORY; HEURISTIC METHODS;

ASYMMETRIC CODES; CONSTANT WEIGHT CODES; TABU SEARCH;

CODES (SYMBOLS);

EID: 0031647358     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/18.651069     Document Type: Article

References (19)

1. T. Back, Evolutionary Algorithms in Theory and Practice: Evolutio Strategies, Evolutionary Programming, Genetic Algorithms. Ne York: Oxford Univ. Press, 1996.
2. S. Bilan and T. Etzion, "The last packing number of quadruples an cyclic SQS," Des. Codes Cryptogr., vol. 3, pp. 283-313, 1993.
3. A.E. Brouwer, H. O. Hämäläinen, P. R. J. Östergard, and N. J A. Sloane, "Bounds on mixed binary/ternary codes," this issue, pp 140-161.
4. A.E. Brouwer, J. B. Shearer, N. J. A. Sloane, and W. D. Smith, " new table of constant weight codes," IEEE Trans. Inform. Theory, vol 36, pp. 1334-1380, 1990.
5. F.C. Chow and J. L. Hennessy, "The priority-based coloring approac to register allocation," ACM Trans. Program. Lang. Syst., vol. 12, pp 501-536, 1990.
6. T. Etzion, "New lower bounds for asymmetric and unidirectional codes, lEEETrans. Inform. Theory, vol. 37, pp. 1696-1704, 1991; vol. 38, pp 1183-1184, 1992.
7. T. Etzion and S. Bitan, "On the chromatic number, colorings, and code of the Johnson graph," Discr. Appl. Math., vol. 70, pp. 163-175, 1996.
8. T. Etzion and P. R. J. Östergard, "Greedy and heuristic algorithms fo codes and colorings," Tech. Rep. CS 909, Comput. Sci. Dept., Technion Haifa, Israel, 1997.
9. G. Fang and H. C. A. van Tilborg, "Bounds and constructions o asymmetric or unidirectional error-correcting codes," Appl. Algebra Eng Commun. Comput., vol. 3, pp. 269-300, 1992.
10. T.A. Feo, M. G. C. Resende, and S. H. Smith, "A greedy randomize adaptive search procedure for maximum independent set," Oper. Res. vol. 42, pp. 860-878, 1994.
11. M.R. Garey and D. S. Johnson, Computers and Intractability: A Guid to the Theory of NP-Completeness. New York: Freeman, 1979.
12. M.R. Garey, D. S. Johnson, and H. C. So, "An application of grap coloring to printed circuit testing," IEEE Trans. Circuits Syst., vol CAS-23, pp. 591-599, 1976.
13. F. Glover, "Tabu search-Part I," ORSA J. Comput., vol. 1, pp. 190-206 1989.
14. A. Hertz and D. de Werra, "Using tabu search techniques for grap coloring," Computing, vol. 39, pp. 345-351, 1987.
15. I.S. Honkala and P. R. J. Östergard, "Code design," in Local Searc in Combinatorial Optimization, E. Aarts and J. K. Lenstra, Eds. Ne York: Wiley, 1997, pp. 441-456.
16. D.S. Johnson, C. R. Aragon, L. A. McGeoch, and C. Schevon "Optimization by simulated annealing: An experimental evaluation; Par II, graph coloring and number partitioning," Oper. Res., vol. 39, pp 378-406, 1991.
17. R.J. McEliece and E. R. Rodemich, "The Constantin-Rao constructio for binary asymmetric error-correcting codes," Inform. Contr., vol. 44 pp. 187-196, 1980.
18. K.J. Nurmela, M. K. Kaikkonen, and P. R. J. Östergard, "New constan weight codes from linear permutation groups," IEEE Trans. Inform Theory, vol. 43, pp. 1623-1630, Sept. 1997.
19. C.L. M. van Pul and T. Etzion, "New lower bounds for constant weigh codes," IEEE Trans. Inform. Theory, vol. 35, pp. 1324-1329, 1989.