Data Compression and Prefix-Free Codes

Probe the link between entropy and coding. In the process, encounter Shannon's first fundamental theorem, which specifies how far information can be squeezed in a binary code, serving as the basis for data compression. See how this works with a text such as Conan Doyle's The Return of Sherlock Holmes

English
  • Runtime 31 minutes
  • Network The Great Courses
  • Created July 22, 2020 by
    Administrator admin
  • Modified February 7, 2023 by
    RicaRaducanu