4 ms·
>I still have a paper copy of Volume 5, number 11. The Huffman encoding article showed a very creative way of recursively writing out the code-tree for static H
by vram22 8y ago
>I still have a paper copy of Volume 5, number 11. The Huffman encoding article showed a very creative way of recursively writing out the code-tree for static Huffman encoding.
I remember reading that article in an old copy of BYTE that I picked up at a used book shop. The article was really good. It was early in my career and I remember being thinking what a cool algorithm it was, and felt good that I could understand how it worked. IIRC, the author's name was Jonathan Amsterdam.
- jim_lawless 8y agoYes it was! They have the issue at the archive: https://archive.org/details/byte-magazine-1986-05 https://archive.org/details/byte-magazine-1986-05
- vram22 8y agoGreat, thanks. Will check it out.
- vram22 8y ago>IIRC, the author's name was Jonathan Amsterdam. Googled his name and found this video by a person with that name, may be the same person whom I mentioned above. He worked at Google on cloud client libraries for Go. Queued to watch later. GopherCon 2017 - Lightning Talk: Jonathan Amsterdam - Errors as Side Notes https://www.youtube.com/watch?v=_wW2U9SGKKI https://www.youtube.com/watch?v=_wW2U9SGKKI Update: I just watched the video, it's very short, and the tool he describes seems useful for understanding new Go code. I won't describe what it does - go watch the video (pun intended).