Crushing Huffman Encoding

Поделиться
HTML-код
  • Опубликовано: 21 ноя 2024

Комментарии • 6

  • @seasn5553
    @seasn5553 5 месяцев назад +30

    Last time I was this early she left.

    • @samtheman1868
      @samtheman1868 5 месяцев назад +3

      perhaps the most based comment possible

    • @LovelyBozo
      @LovelyBozo 5 месяцев назад +3

      this made my day so much better thank you

  • @Nodsaibot
    @Nodsaibot 5 месяцев назад +2

    3 thousand keystrokes just to move a line of code up xD

  • @matiasbpg
    @matiasbpg 5 месяцев назад +6

    There is another way to transmit the Huffman table. Instead of transmitting in it's tree form, you could transmit an array of code lenths and use a canonical algorithm to reconstruct the table. This have the advantage of being easier to compress the lengths table with a RLE esque encoding ( supposing not all possible symbols are always used so you could have runs off zeros)

  • @josundev
    @josundev 5 месяцев назад

    brilliant effort!