Category:Data compression

A

• ► Archive formats‎ (1 C, 71 P)

C

• ► Codecs‎ (6 C, 13 P)
• ► Compression algorithms‎ (2 C, 1 P)

D

• ► Data compression software‎ (4 C, 25 P)

F

• ► Compression file systems‎ (10 P)

T

• ► Texture compression‎ (7 P)

V

• ► Video compression‎ (1 C, 33 P)

• Data compression

A

• Adaptive compression

B

• Binary Ordered Compression for Unicode
• Bitrate peeling
• Bitstream format

C

• Calgary Challenge
• Calgary Corpus
• Canterbury Corpus
• CMX (file format)
• Compressed pattern matching
• Compression artifact
• Context mixing

D

• Data compaction
• Data compression ratio
• Data compression symmetry
• Data deduplication
• Double Tools for DoubleSpace
• DriveSpace
• Dyadic distribution

E

• Error exponent

G

• Generation loss
• Grammar-based code

H

• Hutter Prize

I

• Image compression

K

• Krichevsky–Trofimov estimator

L

• Lossless compression benchmarks
• Lossless data compression
• Lossy compression
• Lossy data conversion
• LZX (algorithm)

M

• Matt Mahoney
• Mode Z compression
• Modulo-N code
• Move-to-front transform

O

• Ocarina Networks

P

• Precompressor
• Prefix code
• Progressive Graphics File

Q

• QDX

R

• Rate–distortion theory
• Recursive indexing
• Robust Header Compression

S

• Sardinas–Patterson algorithm
• Self-extracting archive

S cont.

• Set partitioning in hierarchical trees
• Shannon's source coding theorem
• Signaling Compression
• Silence compression
• Jan Sloot
• Smart Bitrate Control
• Smart Data Compression
• Solid compression
• Sub-band coding

T

• Time-domain harmonic scaling
• Transparency (data compression)
• Trellis quantization
• Twin vector quantization

U

• Unary coding
• Universal code (data compression)

V

• Van Jacobson TCP/IP Header Compression
• Volume (compression)

W

• White noise
• WinZip

Z

• ZeoSync
• Zoo (file format)