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.
@article{arxiv.2105.00406,
title = {Divergence Scaling for Distribution Matching},
author = {Gerhard Kramer},
journal= {arXiv preprint arXiv:2105.00406},
year = {2021}
}
Comments
2021 IEEE International Symposium on Information Theory