Simple and flexible base change algorithm for communication problems

Revision en1, by maomao90, 2024-04-06 17:34:46

Many communication problems involve sending some form of information from one function to another by sending $$$0$$$s and $$$1$$$s (binary) or some number smaller than $$$B$$$ (base $$$B$$$). In these problems, we often need to change the information that we want to send from one base to another.

This can be particularly tricky when the information that we want to send is a sequence of number. A common way to do so is to send each number one by one using $$$\lceil \log_B (K) \rceil$$$ digits where $$$B$$$ is the base we can send information in and the elements of the sequence are between $$$0$$$ and $$$K - 1$$$. The problem with this is that if we are sending $$$N$$$ numbers, we are possibly wasting some digits as $$$N\lceil \log_B (K) \rceil \ge \lceil N\log_B (K) \rceil$$$.

Tags communication, binary numbers, base

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en3 English maomao90 2024-04-07 18:48:18 287 Tiny change: '52141008).\n\nFurther work\n==================\n\n' -> '52141008).' (published)
en2 English maomao90 2024-04-07 12:59:22 2815 Tiny change: 'nce $a_i$ having $l_i$ non' -> 'nce $a_i$ consisting of $l_i$ non'
en1 English maomao90 2024-04-06 17:34:46 818 Initial revision (saved to drafts)