Duc Tu Dao

Average Redundancy of Variable-Length Balancing Schemes à la Knuth

2022 · arXiv (Cornell University)

We study and propose schemes that map messages onto constant-weight codewords using variable-length prefixes. We provide polynomial-time computable formulas that estimate the average number of redundant bits incurred by our schemes. In addition to the …