The user “JiaT75” inserted a backdoor in a tool for this task (10[1])that was (10[1])caught by Microsoft developer Andres Freund (-5[1])in March 2024. Kolmogorov complexity can be conceptualized (10[1])as measuring (10[1])an optimal form of this process. (10[4]-5[2])Inputs (10[1])for this task can be preprocessed (10[1])by the Burrows–Wheeler transform, (10[3])which arranges “similar” characters together. (10[1])One algorithm for this task uses symbol frequencies (-5[1])to construct (10[1]-5[2])a prefix (10[1])tree. (10[3]-5[1])A family of algorithms for this task is named for Abraham Lempel and (10[1])Jacob Ziv. (10[2])Shannon’s source coding theorem (-5[1])bounds the efficiency of this process. (-5[1])Huffman codes can be used to perform (10[3])a “lossless” (10[1])form of this (10[2])task. (10[14])For 10 points, (10[1])name (10[1])this process that decreases the number of bits needed (10[1])to store information, (10[3])which can (10[2])create (10[1]).zip files. ■END■ (10[7])