 Compression is successful if the resulting sequence is shorter than the original sequence (and the instructions for the decompression map).For a compression algorithm to be lossless, the compression map must form an injection from "plain" to "compressed" bit sequences.The pigeonhole principle prohibits a bijection between the collection of sequences of length "N" and any subset of the collection of sequences of length "N"−1.