Are you an EPFL student looking for a semester project?
Work with us on data science and visualisation projects, and deploy your project as an app on top of Graph Search.
Lecture
Encoder and Decoder for Prefix-Free Codes
Description
This lecture covers the implementation and verification of encoder and decoder for prefix-free codes, including classes and types, lemmas on trees, the main theorem, preconditions and postconditions, a roadmap, proof of decode and encode. The instructors discuss the formal verification of prefix-free codes, the optimal tree produced by Huffman's algorithm, and the challenges faced in implementing and verifying the encoder and decoder.
Official source
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.