articleIEEE Transactions on Information TheoryNov 9, 2015Closed access

Constant Composition Distribution Matching

Technical University of Munich

Indexed incrossref

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. The encoder achieves the maximum rate, namely, the entropy of the desired distribution, asymptotically in the blocklength. Furthermore, the normalized divergence of the encoder output and the desired distribution goes to zero in the blocklength.

Citation impact

712
total citations
FWCI
43.82
Percentile
100%
References
28
Citations per year

Authors

2

Topics & keywords

Keywords
  • Encoder
  • Mathematics
  • Invertible matrix
  • Constant (computer programming)
  • Entropy (arrow of time)
  • Distribution (mathematics)
  • Bernoulli distribution
  • Matching (statistics)
No related works found for this paper.