2000 character limit reached
Divergence Scaling for Distribution Matching
Published 2 May 2021 in cs.IT and math.IT | (2105.00406v1)
Abstract: Distribution matchers for finite alphabets are shown to have informational divergences that grow logarithmically with the block length, generalizing a basic result for binary strings.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.