If the U.S. tax code were converted to ASCII and this bit pattern represented with a numeral from a very large number base (units position from 0 to (2^n) -1 where n is allowed to be sufficiently large to contain the bytes needed to present the message), could, with appropriate a priori agreements about the number base, this tax code be transmitted from here to Alpha Centauri (or vice versa) in the form:
(ID1)X1X2X3...(ID2)Y1Y2Y3... Where the IDs identify subtrahends (hexidecimal E) and subtractors (hexidecimal F),
and the Xs and Ys are limited in range to the hexidecimal values 0 thru D.
If so, huge amounts of data could be transmitted via polarization modulation across space with very few character sets sending many repetitions of the same surrogate message. Eight (or some few more) characters repeated 100 times increase the likelihood of accurate communication. Are others already doing this?
This looks to good to be true, so I have probably overlooked a major flaw. Has someone thought of an even more efficient method? I am anxious to be enlightened.