
Data Compression I: Course Intro and Lossless Data Compression Basics
Stanford's EE274, Data Compression Theory and Applications, opens with professor Tsachy Weissman and teaching staff Shubham Chandak and Pulkit Tandon laying out the course structure and the basic problem of lossless compression. Weissman frames compression as a question of representing information with the fewest bits possible while still allowing exact recovery of the original data, and introduces the information-theoretic ideas, entropy, coding efficiency, and the gap between theory and practical algorithms, that the course will build on across the quarter. The lecture surveys what students will cover, from classical techniques like Huffman and arithmetic coding toward later topics in learned and neural compression, and sets expectations for assignments and background needed in probability and algorithms. Delivered as a standard classroom lecture with slides, it functions as both syllabus walkthrough and first substantive pass at why compression is hard and how information theory gives it a rigorous foundation.