Unix Search & Organize Tools

Binary compression methods are widely used in communications, data storage and numeric analysis. Exploring genetic complexity numeric sequences employ such methods. Some of them are presented on this site together with a command-line Win32 implementation(s) that demonstrates the capability of compression of large ASCII data files and binary files and also slightly modified in numeric data sequence analysis. This binary compression method is based on numeric sequence generated by the following binary formula as presented by the C/C++ syntax: #define op_7(x,y)(((x+y)^y)|(((x&y)!=0)?(x&y)/y:0)) . This numeric sequence represents all numbers from 0-255(8-bit) for 0-127(7-bit) arguments in an x-y matrix manner. When always x=y and x:0-127 it results in all 8-bit odd numbers. When applied on a 2-byte data sequence it results in 14 or less bits long index. Combined together with one 1-bit substracting indicator it will allow compression. Using these arguments as dictionary entries coded by hi/lo/length indicators whose reocurring indexes are stored insted of the input data allows gain of an average 30% compression in large ASCII text files. This numeric sequence formula was generated by another routine written for the purpose of exploring numeric sequences generation.