A tabu search approach to the minimum distance of error-correcting codes

REFERENCES

• AUGOT , D. , CHARPIN , P. , and SENDRIER , N. , 1992 , Studying the locator polynomial of minimum weight codewords of BCH codes . IEEE Transactions on information Theory , 38 , 960 – 973 .
   Web of Science ®Google Scholar
• BLAND , J. A. , and DAWSON , G. P. , 1991 , Tabu search and design optimisation . Computer-Aided Design , 23. 195 – 201 .
   Google Scholar
• GLOVER , F. , 1989 , Tabu search, Part I, ORSA Journal of Computing , 1 , 190 – 206 ; 1990, Tabu search, Part II, ORSA Journal of Computing, 2, 4–32 .
   Google Scholar
• HERTZ , A. ,DE WERRA , D. , 1987 , Using tabu search techniques for graph coloring, Computing , 29 , 345 – 351 .
   Google Scholar
• HILL , R. , 1986 , A First Course in Coiling Theory ( Oxford , U.K. Oxford University Press ).
   Google Scholar
• LAGUNA , M. , BARNES , J. W. , and GLOVER , F. , 1991 , Tabu search methods for a single machine scheduling problem . Journal of Intelligent Manufacturing . 2, 63 – 74 .
   Google Scholar
• MACWILLIAMS , F. J. , and SLOANE , N. J. A. , 1993 , The Theory of Error-Correcting Codes ( Amsterdam North-Holland ).
   Google Scholar
• PRETZEL , O. , 1992 , Error Correcting Codes and Finite Fields ( Oxford , U.K. Oxford University Press ).
   Google Scholar
• SKORIN-KAPOV , J. , 1990 , Tabu search applied to the quadratic assignment problem , ORSA Journal of Computing , 2 , 33 – 45 .
   Google Scholar
• SONG , L. and VANELLI , A. , 1992 , A VLSI placement method using tabu search . Microelectronics Journal . 23 , 167 – 172 .
   Google Scholar
• TAILLARD , E. , 1991 , Robust taboo search for the quadratic assignment problem . Parallel Computing , 17 , 443 – 455 .
   Web of Science ®Google Scholar
• ZHANG , M. , and MA , F. , 1994 , Simulated annealing approach to the minimum disiance of error-correcting codes . International Journal of Electronics , 76 , 377 – 384 .
   Google Scholar