ABSTRACT
Note that if A is the input alphabet of a channel, then any finite non-empty subset of A+ could be taken as the input alphabet of the same channel. Changing the input alphabet in this way will necessitate a change in the output alphabet. For instance, if A = {0,1}, and the corresponding output alphabet is B = {0,1,∗}, then if we take  = {00,11}, the new output alphabet will be
B̂ = {00,01,0∗,10,11,1∗,∗0,∗1,∗∗}.
