Constant Composition Distribution Matching

DOI10.1109/TIT.2015.2499181MaRDI QIDQ2977076zbMATH OpenWikidataFDO

Authors Patrick Schulte, Georg Böcherer

Publication date 28 April 2017

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1503.05133

Mathematics Subject Classification ID

Source coding (94A29) Decoding (94B35)

Abstract: Distribution matching transforms independent and Bernoulli(1/2) distributed input bits into a sequence of output symbols with a desired distribution. Fixed-to-fixed length, invertible, and low complexity encoders and decoders based on constant composition and arithmetic coding are presented. Asymptotically in the blocklength, the encoder achieves the maximum rate, namely the entropy of the desired distribution. Furthermore, the normalized divergence of the encoder output and the desired distribution goes to zero in the blocklength.

Cited in

(2)

• Probabilistic Amplitude Shaping
• Quantum communications in continuous variable systems

This page was built for publication: Constant Composition Distribution Matching

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2977076)