Zxus 🅱️Logs

Huffman Coding Huffman Coding is a popular algorithm used for data compression. It was developed by David A. Huffman in 1952 as part of his research on finding the most efficient binary code. Huffman Coding is widely used because of its simplicity and effectiveness in reducing data size without losing information. Table of Contents Introduction How Huffman Coding Works Example of Huffman Coding Decoding with Huffman Code Advantages of Huffman Coding Applications of Huffman Coding Limitations of Huffman Coding Introduction Huffman Coding is a lossless compression algorithm, meaning no data is lost during the compression process. The algorithm is based on the concept of variable-length encoding, where more frequent characters are assigned shorter codes, and less frequent characters receive longer codes. This way, Huffman Coding minimizes the total number of bits needed to represent a data set, leading to efficient compression. ...

Embracing Git Submodules: A Journey to a Seamless Dotfiles Setup I had been using stow since it was simple, but I was tired of making countless number of directories. I believed there had to be a better way. and oh boy, yadm it was. In my quest towards a perfect dotfiles setup in my Arch Linux and Neovim PDE (btw), Git submodules turned out to be hero I needed but not deserved. Here’s the anecdote to what happened: ...

Introduction This is bold text, and this is emphasized text. Visit the Hugo website!