Divergence Scaling for Distribution Matching

05/02/2021

∙

by   Gerhard Kramer, et al.

∙

0

∙

share

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.