Data Compression
The process of encoding information using fewer bits than the original representation, crucial for storage and transmission.
Core metadata
- ID: data_compression
- Era: Modern
- First known date: 1952 (exact)
- Region: Cambridge, Massachusetts, United States
- Review status: source_checked
- Maturity: N/A
Prerequisites
- Algorithms & Computation Theory (algorithms_computation_theory)
- Information Theory (information_theory)
Dependents
- Cable Modems / DOCSIS (cable_modems_docsis)
- Digital Signal Processing (DSP) (digital_signal_processing)
- Internet (internet)
- Packet Switching (packet_switching)
- World Wide Web (world_wide_web)
Fields
- None.
Node sources
- Huffman Coding (ACM Computing Surveys, 2019, review) • Supports: node
Locator: The ACM survey identifies Huffman coding as dating to Huffman's 1952 paper on minimum-redundancy codes.
Prerequisite edge evidence
Edge/source evidence summary:
- Prerequisite edges: 2
- Average edge confidence: 68%
- Prerequisite sources: 2
- expert_inference: 2
| Prerequisite | Type | Confidence | Evidence level | Note | Sources |
|---|---|---|---|---|---|
| Information Theory (information_theory) | enabling | 68% | expert_inference | Information Theory provides a capability that enables this technology without being the only possible path. |
|
| Algorithms & Computation Theory (algorithms_computation_theory) | enabling | 68% | expert_inference | Algorithms & Computation Theory provides a capability that enables this technology without being the only possible path. |
|
This page is generated from canonical era JSON and is indexable by URL.