Average Redundancy of Variable-Length Balancing Schemes à la Knuth

04/29/2022
by   Duc Tu Dao, et al.
0

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 exact formulas, we also perform an asymptotic analysis and demonstrate that our scheme uses 1/2log n+O(1) redundant bits to encode messages into length-n words with weight (n/2)+ q for constant q.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
12/21/2022

Every Bit Counts: A New Version of Non-binary VT Codes with More Efficient Encoder

In this work, we present a new version of non-binary VT codes that are c...
research
02/15/2021

Timely Transmissions Using Optimized Variable Length Coding

A status updating system is considered in which a variable length code i...
research
10/15/2019

Optimal Codes Correcting a Single Indel / Edit for DNA-Based Data Storage

An indel refers to a single insertion or deletion, while an edit refers ...
research
08/12/2021

Space-Efficient Huffman Codes Revisited

Canonical Huffman code is an optimal prefix-free compression code whose ...
research
09/16/2023

Private Variable-Length Coding with Sequential Encoder

A multi-user private data compression problem is studied. A server has a...
research
01/05/2018

Variable-Length Intrinsic Randomness Allowing Positive Value of the Average Variational Distance

This paper considers the problem of variable-length intrinsic randomness...
research
05/21/2021

Nori: Concealing the Concealed Identifier in 5G

IMSI catchers have been a long standing and serious privacy problem in p...

Please sign up or login with your details

Forgot password? Click here to reset