Constant Composition Distribution Matching.

Information Theory, IEEE Transactions(2016)

引用 663|浏览758
暂无评分
摘要
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.
更多
查看译文
关键词
Arithmetic Coding,Asymptotically Optimal Algorithm,Distribution Matching,Distribution matching,Fixed Length,arithmetic coding,asymptotically optimal algorithm,fixed length
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要