Binary constrained letter-by-letter homophonic coding

In a perfect binary homophonic coding scheme the letters in each homophonic codeword are independent and identically distributed equally likely binary random variables. The main purpose of this paper is to introduce a new binary- constrained homophonic coding scheme, by which is meant that the letters in each homophonic codeword are independent and identically distributed but not equally likely binary random variables. Furthermore, this homophonic coding scheme requires a finite number of short codewords which by concatenation produce the homophonic codewords. This type of homophonic coding scheme may find application in situations where the cost of storing or transmitting 0's and 1's are distinct.