The shannon capacity on C(n,k)

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...

Effects of Changing the Midge’s Sampling Frequencies on Battery Life and Storage

The Socially Perceptive Computing Lab (SPCL) at Delft University of Technology has developed a device called the Midge. The aim of this device is to record data of social interactions at conferences. This paper aims to characterise how battery life is affected by different sensor settings on the Midge as well as how much data is generated in a...

Classical Capacities of Classical and Quantum Channels

This thesis investigates two types of classical capacities of both classical and quantum channels, giving rise to four different settings. The first type of classical capacity investigated is the ordinary capacity of a channel to transmit classical information with a probability of error which becomes arbitrarily small as the channel is used...

Rock-Fluid Interaction During Low-Salinity Polymer Flow in Porous Media

Usually, oil fields are developed over three stages. First is the primary oil recovery, where the natural underground pressure is used to drive the oil to the surface. Afterwards is the secondary oil recovery, usually by water flooding or gas injection. However, the water flood yields lower sweep efficiency in heterogeneous reservoirs, contrary...

The Shannon capacity of graphs

In this thesis you will find an overview of the main results of Lovasz and Shannon, together with a substantial set of examples for which we have computed the Shannon capacity. Also, some graphs for which it is not possible to calculate the Shannon capacity are given.