A new form of coding characters

From: anbu@peoplestring.com
Date: Fri Feb 04 2011 - 13:44:37 CST

  • Next message: anbu@peoplestring.com: "Corrected: Anew form of coding characters"

    1. Combine binary digits (0 and 1) i.e. 00, 01, 10, 11 2. Enumerate half
    the combinations e.g. Enumeration of 00 and 01 is 00, 01, 0000, 0001, 0100,
    0101, 000000, 000001 and so on 3. Enumerate other half i.e. Enumeration of
    10 and 11 is 10, 11, 1010, 1011, 1110, 1111 and so on 4. Concatenate or
    combine latter and former enumerations i.e. Concatenation of: 10 and 00 is
    1000, 10 and 01 is 1001, 10 and 0000 is 100000, 11 and 00 is 1100 and so on
    (These are codes ready to be assigned to characters). Combinations of: 10
    and 00 is 1000 and 0010, 10 and 01 is 1001 and 0110, 11 and 0000 is 110000
    and 000011, 111111 and 0000 is 1111110000 and 0000111111 and so on 5.Remove
    latter combinations without combinations in the starting or ending
    enumeration and substitute the first or second, or the last or just before
    last combination respectively in this enumeration with combination from
    other half e.g. I have chosen to remove these without combinations in the
    starting enumeration i.e. Does 1000 have combinations in the starting
    enumeration? The starting enumeration is 10. It has a combination of 1 and
    0 and that's it. It has a combination, but not have combinations. So the
    answer is NO. Does 110000 have combinations in the starting enumeration?
    The starting enumeration is 11. It has a combination of 1 and 1 and that's
    it. It has a combination, but not have combinations. So the answer is NO.
    Does 000011 have combinations in the starting enumeration? The starting
    enumeration is 0000. It has a combination of 0 and 0 (twice), and 00 and
    00. It has three combinations. So the answer is YES. So remove 1000, 110000
    and similar combination. Then, I have decided to substitute the first
    combination in the combinations that were not removed e.g. 000011 i.e. The
    first combination of 000011 is 00 (the starting 00). I substitute it with
    10 (I decided to use 10-One can use any combination from the other half
    i.e. 10. 11, 1010 or any other. In this case the other half is 10, 11, 1010
    or any other. In some cases the other half is 00, 01, 0000 or any other:
    for those starting with 1). The sustituted is 100011. The substitution must
    be consistent e.g. 10 replacing 00, always. Further examples, Sustitution
    of: 101100 is (I decide to substitute 10 with 01) 011100 000111 is 100111
    Now, the final codes you get after substitution are ready to be assigned to
    characters. I tried this. They work better than any other character
    encoding present. Combination of the final codes result in a very good
    coding for characters.



    This archive was generated by hypermail 2.1.5 : Fri Feb 04 2011 - 15:21:21 CST