python implementation of a new integer encoding algorithm.

[janhein.vanderburg at gmail.com]

On Wednesday, February 18, 2015 at 11:20:12 PM UTC+1, Dave Angel wrote:
> I'm not necessarily doubting it, just challenging you to provide a data 
> sample that actually shows it.  And of course, I'm not claiming that 
> 7bit is in any way optimal.  You cannot define optimal without first 
> defining the distribution.

Weird results.
For a character size 2 the growth processes are shown below.
I listed the decimal representations, the difficult representation, a stop bit encoding, and the number of characters they differ in length:
0:  00				00				0
1:  01				01				0
2:  10, 00			10, 00				0
3:  10, 01			10, 01				0
4:  10, 10			11, 00				0
5:  10, 11			11, 01				0
6:  11, 00.00			11, 10, 00			0
7:  11, 00.01			11, 10, 01			0
8:  11, 00.10			11, 11, 00			0
9:  11, 00.11			11, 11, 01			0
10: 11, 01.00			11, 11, 10, 00			1
11: 11, 01.01			11, 11, 10, 01			1
12: 11, 01.10			11, 11, 11, 00			1
13: 11, 01.11			11, 11, 11, 01			1
14: 11, 10.00, 00		11, 11, 11, 10, 00		1
15: 11, 10.00, 01		11, 11, 11, 10, 01		1
16: 11, 10.00, 10		11, 11, 11, 11, 00		1
17: 11, 10.00, 11		11, 11, 11, 11, 01		1
18: 11, 10.01, 00.00		11, 11, 11, 11, 10, 00		1
19: 11, 10.01, 00.01		11, 11, 11, 11, 10, 01		1
20: 11, 10.01, 00.10		11, 11, 11, 11, 11, 00		1
21: 11, 10.01, 00.11		11, 11, 11, 11, 11, 01		1
22: 11, 10.01, 01.00		11, 11, 11, 11, 11, 10, 00	2
23: 11, 10.01, 01.01		11, 11, 11, 11, 11, 10, 01	2
24: 11, 10.01, 01.10		11, 11, 11, 11, 11, 11, 00	2
25: 11, 10.01, 01.11		11, 11, 11, 11, 11, 11, 01	2
26: 11, 10.01, 10.00		11, 11, 11, 11, 11, 11, 10, 00	3

I didn't take the time to prove it mathematically, but these results suggest to me that the complicated encoding beats the stop bit encoding.