The shannon capacity on C(n,k)

More Info


This thesis focuses on a problem formulated by Claude Shannon named the Shannon capacity. This problem is about information rate per time unit over a noisy channel. The noisy channel is here represented by a graph. We specifically focus on a class of circulant graphs that are denoted by C(n,k) with vertex set z/nz, where all vertices are connected with the k-1 vertices before and after it. We will discuss upper bounds that were found for the Shannon capacity and how C(n,k) behaves with these upper bounds. After that we will focus on multiple ways to calculate lower bounds for the Shannon capacity of $C(n,k)$. For these three search methods will be used. These are exhaustive searching for optimal values, optimal ways to make packagings and solutions created by using a special form. As last the answers will be discussed by combining the upper and lower bounds for C(n,k). From this conclusions are drawn after which some possibilities will be given for further research.