An approximation of the capacity of a simple channel

Abstract

We discuss the bounds for capacity of a binary-input binary-output discrete memoryless communication channel. We introduce a new lower bound that gives a very good and elementary approximation to the capacity