Optimal Quantization for Distribution Synthesis

H. A. Simon, “On a class of skew distribution functions,” Biometrika , vol. 42, no. 314, pp. 425–440, 1955

1955

Earlier work this paper cites.

R. G. Gallager, Information Theory and Reliable Communication . John Wiley & Sons, Inc., 1968

1968

Earlier work this paper cites.

A. D. Wyner, “The common information of two dependent random variables,” IEEE Trans. Inf. Theory , vol. 21, no. 2, pp. 163–179, Mar. 1975

1975

Earlier work this paper cites.

T. S. Han and S. Verdu, “Approximation theory of output statistics,” IEEE Trans. Inf. Theory , vol. 39, no. 3, pp. 752–772, 1993

1993

Earlier work this paper cites.

Y. Steinberg and S. Verdu, “Simulation of random processes and rate-distortion theory,” IEEE Trans. Inf. Theory , vol. 42, no. 1, pp. 63–86, Jan. 1996

1996

Earlier work this paper cites.

D. Raphaeli and A. Gurevitz, “Constellation shaping for pragmatic turbo-coded modulation with high spectral efficiency,” IEEE Trans. Commun. , vol. 52, no. 3, pp. 341–345, 2004

2004

Earlier work this paper cites.

F. Schreckenbach and P. Henkel, “Signal shaping using non-unique symbol mappings,” in Proc. Allerton Conf. Commun., Contr., Comput. , Sep. 2005

2005

Earlier work this paper cites.

T. M. Cover and J. A. Thomas, Elements of Information Theory , 2nd ed. John Wiley & Sons, Inc., 2006

2006

Earlier work this paper cites.

Y. A. Reznik, V. Chandrasekhar, G. Takacs, D. M. Chen, S. S. Tsai, and B. Girod, “Fast quantization and matching of histogram-based image features,” in Proc. SPIE 7798, App. Digital Image Proc. XXXIII , San Diego, Aug. 2010

2010

Cited alongside, same era.

G. Böcherer and R. Mathar, “Matching dyadic distributions to channels,” in Proc. Data Compression Conf. (DCC) , Mar. 2011, pp. 23–32

2011

Cited alongside, same era.

I. Csiszár and J. Körner, Information Theory: Coding Theorems for Discrete Memoryless Systems . Cambridge University Press, 2011

2011

Cited alongside, same era.

Y. A. Reznik, “An algorithm for quantization of discrete probability distributions,” in Proc. Data Compression Conf. (DCC) , Snowbird, UT, Mar. 2011, pp. 333–342

2011

Cited alongside, same era.

G. Böcherer, “Capacity-achieving probabilistic shaping for noisy and noiseless channels,” Ph.D. dissertation, RWTH Aachen University, 2012. [Online]. Available: http://www.georg-boecherer.de/capacityAchievingShaping.pdf

J. Hou and G. Kramer, “Informational divergence approximations to product distributions,” in Proc. Canadian Workshop Inf. Theory (CWIT) , Jun. 2013, pp. 76–81

2013

Closest in time.

M. Yankov, S. Forchhammer, K. J. Larsen, and L. P. Christensen, “Rate-adaptive constellation shaping for near-capacity achieving turbo coded BICM,” in Proc. IEEE Int. Conf. Commun. (ICC) , 2014, pp. 2112–2117

2014

Closest in time.

S. Verdú, “Total variation distance and the distribution of relative information,” in Proc. Inf. Theory and Applicat. Workshop (ITA) , San Diego, CA, Feb. 2014, pp. 499–501

2014

Closest in time.

D. Berend, P. Harremoës, and A. Kontorovich, “Minimum KL-divergence on complements of L 1 L_{1} balls,” IEEE Trans. Inf. Theory , 2014

2014

Closest in time.

T. van Erven and P. Harremoës, “Rényi divergence and Kullback-Leibler divergence,” IEEE Trans. Inf. Theory , vol. 60, no. 7, pp. 3797–3820, Jul. 2014