On product of association schemes and Shannon capacity
✍ Scribed by Dezső Miklós
- Publisher
- Elsevier Science
- Year
- 1996
- Tongue
- English
- Weight
- 304 KB
- Volume
- 150
- Category
- Article
- ISSN
- 0012-365X
No coin nor oath required. For personal study only.
✦ Synopsis
In this paper we will define the product of two association schemes and using the fact that the strong product of two graphs from two (possibly different) association schemes is in the product of the association schemes, we give a new proof of Schrijver's result on the Shannon capacity of graphs in association schemes. In particular, this will give a new proof of the fact that the Shannon capacity of the pentagon is x/5.
📜 SIMILAR VOLUMES
An independent set with 108 vertices in the strong product of four 7-cycles (C 7 C 7 C 7 C 7 ) is given. This improves the best known lower bound for the Shannon capacity of the graph C 7 which is the zero-error capacity of the corresponding noisy channel. The search was done by a computer program u