On the traveling salesman problem in binary hamming spaces

IEEE Transactions on Information Theory

Volumn 42, Issue 4, 1996, Pages 1274-1276

  Cohen, Gérard ^a,b   Litsyn, Simon ^c   Zémor, Gilles ^a,b  

^a IEEE

^b TELECOM PARISTECH   (France)

^c TEL AVIV UNIVERSITY   (Israel)

Author keywords

Data compression; Gray codes; Minimal cycle; Traveling salesman

Indexed keywords

BINARY CODES; COMPUTER HARDWARE; DATA COMPRESSION; ESTIMATION; INFORMATION THEORY; PROBLEM SOLVING; VECTORS;

BINARY HAMMING SPACE; GRAY CODES; LINEAR CODES; MINIMAL CYCLE; TRAVELING SALESMAN PROBLEM; VERTICES;

OPTIMIZATION;

EID: 0030190068     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/18.508858     Document Type: Article

References (9)

1. M. J. Aaltonen, "Notes on the asymptotic behavior of the information rate of block codes," IEEE Trans. Inform. Theory, vol. IT 30, pp. 84-85, 1984.
2. D. Augot, P. Charpin, and N. Sendrier, "Studying the locator polynomials of minimum weight codewords of BCH codes," IEEE Trans. Inform. Theory, vol. 38, pp. 960-973, 1992.
3. S. D. Dodunekov and N. L. Manev, "An improvement of the Griesmer bound for some small minimum distances," Discr. Appl. Math., vol. 12, pp. 103-114, 1985.
4. L. Levitin and M. Karpovsky, "Traveling salesman problem in the space of binary vectors," in Proc. IEEE Int. Smp. on Information Theory (Trondheim, Norway, 1994), p. 316.
5. F. J. MacWilliams and N. J. A. Sloane, The Theory of Error-Correcting Codes. Amsterdam, The Netherlands: North-Holland, 1977.
6. J. Simonis, "On generator matrices of codes," IEEE Trans. Inform. Theory, vol. 38, p. 516, 1992.
7. J. A. Storer, Data Compression - Methods and Theory. Ruckville, MD: Computer Sci. Press, 1988.
8. 2?" J. Fac. Sci. Tokyo, IA, vol. 28, pp. 715-720, 1981.
9. A. J. van Zanten, "Minimal-change order and separability in linear codes," IEEE Trans. Inform. Theory, vol. 39, pp. 1988-1989, 1993.