Originally Posted by

**GOURDHEAD**
Very little efficiency can be gained when sending short messages and I need software (e.g., BASIC) capable of computing a specific answer from a selected pair of numbers. As someone has suggested, a modified ASCII code may increase the efficiency.

The following, although not providing an exact answer, will, I hope, demonstrate the procedure:

The decimal number we wish to send is 21,785,119,738,128,229 requiring 56 bits if not coded as I suggest.

We could send X59-XY where X is the coefficient of (2^59)^0, 59 designates the power of 2 forming the number base (576,460,752,303,423,488), and Y is the power of 2 designating the number base of the subtrahend. 59 was somewhat arbitrarily chosen to make sure I had a value greater than 21,785,119,738,128,229, and I need computational software to get more specific.

We could send xxxx0101100100101101xxxxyyyyyyyy using a total of 48 bits when coded as I suggest. Here the x's refer to the coefficient of the power of the number base which power increases, starting at zero in the right most position, from right to left as we normally express decimal numbers. The y's indicate the number base of the subtrahend. Note that 8 bits are used to indicate subtraction (or addition or multiplication) which we could eliminate by apriori agreement and have a savings based on 32 versus 56 bits in this case.