[csxnytuy] Power sets of radicals

Identify a set of N radicals among Chinese characters (kanji) and 2^N characters which cover every possibility of presence or absence of those radicals.  They may contain more radicals outside of the set.

This provides a way to encode binary information, N bits per character.

Might be better for some slots to contain more than 2 possibilities, e.g., hats.

Already done for Korean.

To maximize the difficulty of machines parsing the data, calligraphy.