In this talk we will discuss about the minimum encoding length (bits per symbol) of arbitrary distributed random variables (not necessarily i.i.d) so that they are decoded with arbitrarily small probability of error. We will also talk about the capacity of arbitrary channel (not necessarily stationary and memoryless). These results are due to Han and Verdu.