Effective lossless compression of fixed-length data

Traditional lossless compression algorithms have some limitations to compress the data with special data structure. For fixed-length data compression of special industries, an algorithm was proposed based on Huffman coding and dictionary coding. The proposed algorithm uses an iterative approach to explore the repeated signature of the character strings. The compression dictionary was obtained and the data were compressed and transferred safely. Experiments prove that the proposed algorithm is more practical than the traditional LZW compression algorithm for the data compression with special structure. It has an improved compression ratio and a strong sense of confidentiality.