Types of compression program
Entropy coding is used in computer science and information theory in the form of Huffman coding that produces lossless data compression (Wikipedia “Huffman coding”, 2013: 1). Huffaman codes and ‘prefix’ codes are synonymous as Huffman codes are ubiquitous in computing. The type of compression techniques to be examined in this book are algorithmic compression techniques as developed by the author and address both whole segments of common, or likenatured, polymer units and specific, or truncated, aspects of a linear sequential string or a random or non-random type. A non-random binary sequential string is as follows:
 A series of alternating binary characters sub-grouped into 2 likenatured characters that have a total length of 14 binary characters. A random binary sequential string is as follows:
 This is a pattern-less series of alternating 18 binary characters in length that are not compressible by traditional measures of compression. A compressible random binary sequential string is introduced in the next chapter and was discovered by the author in 1998.