Fixed-length strategies for the binary multiplying channel

An achievable rate region for the binary multiplying channel is established such that block codes exist at all rate pairs within this region, with error probability that decreases exponentially with increasing block length. The result are generalized to asymmetrical rate pair.<
>