Backend
Lossless Source Coding with Marginal Distribution Constraint
arXiv math.IT0 views
arXiv:2611.07156v1 Announce Type: new 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.
Source：https://arxiv.org/abs/2611.07156PreviousElapsed-Service-Time-Aware Preemption for Age of Information MinimizationNextFunctional Converses for Private Matrix-Product Retrieval under Library-Wide Decoder-Side Correlation
Related posts
Catch secrets before they reach git: a pre-commit check for Node repos
0dev.to
One codebase, two renderers: live previews in the browser, final renders in the cloud
0dev.to
Controversy Gate Second Model Check
0dev.to
RabbitMQ's Default Prefetch Is Unlimited. One Slow Worker Can Hoard the Whole Queue
0dev.to
$11.4 Million in NVIDIA Cargo Vanishes Aboard a Food Truck: AI Chip Theft Continues in the Bay Area
0dev.to
Docker vs Kubernetes: What’s the Difference? Simple Guide
0dev.to