Lossless binary data compression

Abstract

Lossless binary data compression of any arbitrary input file is achieved by describing the file using a finite universal set of binary constructs, creating a file content of occurring binary constructs, organizing the content in sequential groups and slices, with one slice to include several groups and one group to include several binary constructs, forming two or more data structures for each slice with each data structure having specific properties with respect to a chosen binary construct, processing the formed data structures together such that compression gain is achieved, with the process of obtaining compression gain being uniquely reversible, and with when the file compression is complete, the compressed output becomes the input file for another compression cycle, with the cycle repeating until a compression criteria is met.

CPC Classifications