Approximations for the capacity of binary input discrete memoryless channels

In this paper, we present our results on lower and upper bounds for the capacity of binary input discrete memoryless channels. These bounds also serve as good approximations for the capacity of these channels. Our results generalize previous analysis of bounds for binary input, binary output discrete memoryless channels and also constitute an extension of the new field of algebraic information theory.