Papers for

data security developers

Papers whose findings have a practical use for this group, as judged from the abstract. Open a paper to read what it means in practice.

Lossless coding matches symbol frequencies exactly for new applications

Lossless Source Coding with Marginal Distribution Constraint

Abstract: We consider lossless source coding with a marginal distribution constraint on the encoding symbols (SC-MDC). Unlike distribution matching, signal shaping and homophonic coding which require the symbols to be (approximately) i.i.d. following a target distribution, SC-MDC requires each symbol to have a marginal distribution that exactly matches the target distribution, which can be regarded as a perfect perceptual quality constraint on the symbols, and may have applications to wear leveling, source coding with cost and steganography. We give nonasymptotic lower and upper bounds on the optimal encoding length, and exactly characterize the coding rate (or the first-order term of the length) when the source distribution or the target distribution is uniform, or when the source is an i.i.d. sequence.

Wed 4 NovInformation Theory
The gist
This paper studies a way to compress data without losing any information, but with a twist: the frequency of each symbol after encoding must match a given pattern exactly. This requirement is stricter than previous methods which only aimed for similar or approximate distributions. The authors provide mathematical formulas that describe the best possible compression lengths when this exact-frequency condition holds, especially in some special cases like uniform sources or uniform target distributions. Their work could help in areas where the exact distribution of encoded symbols matters a lot, such as device wear leveling or hiding information.
Open → 2611.07156v1