On the Shannon capacity of an arbitrary channel
β Scribed by J.H.B Kemperman
- Publisher
- Elsevier Science
- Year
- 1974
- Weight
- 822 KB
- Volume
- 77
- Category
- Article
- ISSN
- 1385-7258
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
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
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