## A combinatorial packing problem, in: Computers in Algebra and Number Theory (proc

- D Baumert, R J Mceliece, E Rodemich, H C Rumsey, R Stanley, H Taylor
- SIAM-AMS Sympos. Appl. Math.) Amer. Math. Soc…
- 1971

- Published 1969

An independent set with vertices in the strong product of four cycles C C C C is given This improves the best known lower bound for the Shannon capacity of the graph C which is the zero error capacity of the corresponding noisy channel The search was done by a computer program using the simulated annealing algorithm with a constant time temperature schedule

@inproceedings{Vesel1969ImprovedLB,
title={Improved Lower Bound on Shannon Capacity of C7},
author={Aleksander Vesel and Janez Zerovnik},
year={1969}
}