Packet 1: Tossup 17

This process cannot decrease the code rate below the Shannon entropy according to the source coding theorem. Abraham Lempel and Jacob Ziv developed this process’s LZ77 (15[2]-5[1])algorithm, which is combined with Huffman coding in an algorithm (-5[1])nicknamed (15[1])DEFLATE. (15[1])Some algorithms (-5[1])for this process allow for (-5[1])perfect reconstruction (15[1])by removing redundancies without removing (*) information. Unlike PNG files, JPEG (10[1])files (10[2])use a “lossy” form (10[2])of this (10[2])process (10[1])that (10[1])creates (10[1])rectangular artifacts. Folders subjected (10[1])to this (10[1])process become ZIP files. (10[1])For 10 points, (10[1])name this process that reduces a data file’s size. ■END■ (10[4])

ANSWER: data compression [or compressing data]
<Computer Science — Sarah Benner> | SHOW-ME Four Packet 1
= Average correct buzzpoint

Back to tossups

Buzzes


Summary

TournamentEditionMatchHeardConv. %Power %Neg %Avg. Buzz
Rube Goldberg XIX11/20/20251681%6%6%66.38
SHOW-ME Four Nationwide HS11/20/20255100%60%40%50.20
SPOOKY IX11/20/20255100%20%20%64.20