Almost minimum-redundancy construction of balanced codes using limited-precision integers

We present a technique based on permutations, the well known arcade game Pacman, and limited-precision integers to encode data into balanced codewords. The redundancy that is introduced by the encoding is particularly low. The results are noticeably better than those of previous work. Still, the resources required by our technique remain modest: there is no need for costly calculations using large integers and the time and space complexity for encoding or decoding a block is linear.