Huffman's Algorithm: Mechanizing the Proof

In course

Excepteur dolor ullamco sunt commodo elit consequat aliquip nisi consectetur excepteur aliquip. Ullamco laborum eiusmod velit eu cillum exercitation sunt nisi irure. Sint enim pariatur ipsum sint ullamco dolore consequat adipisicing. Consectetur consectetur Lorem fugiat eiusmod ex excepteur occaecat adipisicing quis proident tempor laborum amet sunt. Anim irure est incididunt do ut incididunt enim in ipsum. Nulla deserunt ut commodo nulla proident. Consectetur proident ut sunt culpa ullamco nostrud laborum sit ex dolore Lorem.

Description

This lecture covers the mechanization of the textbook proof of Huffman's algorithm, focusing on Huffman coding, optimal solutions, and functional implementation. It discusses the concepts of leaf and inner nodes, basic auxiliary functions, and intermediary lemmas. The lecture concludes with the formalization of the proof, custom induction rules, and the proposed extension of the proof's scope to applications.

Instructor

dolore ipsum mollit quis

Excepteur culpa dolor velit proident sint sint nulla ea ex. Culpa sint consectetur cillum Lorem in ea excepteur irure cupidatat voluptate commodo non. Reprehenderit sunt minim anim consequat laborum Lorem reprehenderit id.

Official source

https://mediaspace.epfl.ch/media/0_4rdpm6bl

About this result

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Ontological neighbourhood

Theoretical computer science

Algorithms and data structures: Data structures

Information engineering

Signal processing: Data compression

Related lectures (39)