Quote: compress blocks of data by repeatedly replacing common byte pairs with an unused byte; comparable to LZW compression with much lower space requirements

Quotation Skeleton

The [byte pair encoding] algorithm compresses data by finding the … pair with a byte that was not in … there are no more frequently occurring pairs or … pair substitutions before the packed data. [It compresses the pair table.] … [p. 31] the expansion algorithm operates in a single … [It] obtains input bytes from one of two … [p. 35] [BPE works particularly well for runs of identical bytes.] … [p. 36] The expansion routine is so simple that, … … [p. 36] The block size is critical to both … binary data. … [p. 37] [Compared BPE with a 5K block to LZW on an EXE file. Depending on options, the compressed file size was smaller or a bit larger. The fast version of BPE was a bit slower for compression. Compression and expansion space requirements were much lower. Expansion speed was 20% faster.   Google-1   Google-2

Copyright clearance needed for quotation.

Related Topics

Topic: data compression algorithms (53 items)