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

We rewrote zg in Rust, cutting indexing time by 65% and peak memory by 53%
0Rust Users Forum

Michiu (now at v0.2.2!): An experimental GUI library for Windows focused on DirectComposition, wgpu, and DOD
0Rust Users Forum
Mocking a 410 Gone for a Retired Resource vs a Plain 404
0dev.to
Three MCP Python SDK Advisories, and the One an Upgrade Will Not Fix
0dev.to
We Benchmarked GPT-Image-2.6 Native <svg> Output: Path Counts, Cost & Real Edge Cases
0dev.to
When an MCP Tool Needs a Missing Value: Elicitation vs Failing the Call
0dev.to