On Aug 11, 6:30 am, LawCounsels <[email protected]> wrote: > Warm Greetings :
here is link to download a 'mathematics structure' encoding of a complete random 4,074 bits long file (a random chosen part of Mark Nelson's AMillionRandomDigits.bin challenge) www dot box dot net/shared/eyy2v28dbf download link's new discovered 'mathematics structure' endoded file's details . in a file with N bits (sufficient large like 8Kbits onwards to 1Mbits) , assume the distributions of unique prefix '0's or '10' or '110' or '1110' ... or '111...10' (always ends with a '0') is standard binomial power (ie random) , BUT with added constraints/ restriction that the maximum length of '111....10' at any time could only be at most log(base2)[R] where R is the total # of bits from present bit position to the end Least Significant Bit position [ eg if bits_string is 0 111110 11110 10 0 10 110 10 0 10 0 10 0 0 ' then here 110 is the 13th bits , there can be no unique prefix of total# of bits length > log(base2)[R] at any time, where R is the bit position # of the unique prefix counting from end Least Significant position bit ....] ....so this is not simple regular usual normal binomial power series/ random distributions [ usual normal binomial power series/ random distributions is 'god gifted' not to be compressible] , but here there is added constraint/ restriction that eg '1110' ( of length 4 bits long) could not occur at position R = 15 or smaller (since log(base2) [R=15 or smaller value of R] will not allow unique prefix of total# of bits >= 4 to occur at position R < 16 ...... THIS IS IMMEDIATE APPARENT READY COMPRESSIBLE 4,073 bits 'constraint' 'mathematics structures' encoded (1 bit smaller) file , from input random 4,074 bits 'random' file -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to [email protected]. To unsubscribe from this group, send email to [email protected]. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
