To know where rows end, image files have (a)   , which defines properties like dimensions.

One way to compress data is to reduce repeated or (a)   information.

A compression technique that has this characteristic is called (a)   compression, because we don't lose anything.

To do this, we need a (a)   that stores the mapping from codes to data.

One method for generating efficient codes is building a Huffman (a)   , invented by David Huffman while he was a student at MIT in the 1950's.

Both run-length (a)   and dictionary coders are lossless compression techniques.

This idea of discarding or reducing precision in a manner that aligns with human perception is called " (a)   coding”.

This is called (a)   redundancy. We don't need to retransmit those pixels every frame of the video; we can just copy patches of data forward.

It's important to know about (a)   because it allows users to store pictures, music, and videos in efficient ways.