input,” IEEE Trans. Wireless Commun. , vol. 4, pp. 2193–2206, Sep. 2005. 

[9] J. Huang and S. Meyn, “Characterization and computation of optimal distributions for channel coding,” IEEE Trans. Inf. Theory , vol. 51, pp. 2336 –2351, July 2005. 

[10] T. H. Chan, S. Hranilovic, and F. R. Kschischang, “Capacity-achieving probability measure for conditionally Gaussian channels with bounded inputs,” IEEE Trans. Inf. Theory , vol. 51, pp. 2073–2088, June 2005. 

[11] T. Lutz, C. Hausl, and R. K¨otter, “Coding strategies for noise-free relay cascades with half-duplex constraint,” in Proc. IEEE Int. Symp. Information Theory , pp. 2385–2389, Toronto, ON, Canada, July 2008. 

[12] G. Kramer, “Communication strategies and coding for relaying,” Wireless Networks , vol. 143 of The IMA Volumes in Mathematics and its Applications, pp. 163–175, 2007. 

[13] T. Lutz, G. Kramer, and C. Hausl, “Capacity for half-duplex line networks with two sources,” in Proc. IEEE Int. Symp. Information Theory , pp. 2393–2397, Austin, TX, USA, June 2010. 

[14] D. Guo and L. Zhang, “Rapid on-off-division duplex for mobile ad hoc neworks,” in Proc. Allerton Conf. Commun., Control, & Computing , Monticello, IL, USA, 2010. 

[15] D. W. Stroock, Probability Theory, an Analytic View . New York: Cambridge Univ. Press, 1993. 

[16] Y. V. Prokhorov, “Convergence of random processes and limit theorems in probability theory,” Theory Probab. Appl. , vol. 1, pp. 157–214, 1956. 

[17] Y. Wu and S. Verd´u, “Functional properties of mmse,” in Proc. IEEE Int. Symp. Information Theory , pp. 1453–1457, June 2010. 

[18] S. Lang, Complex Analysis . New York: Springer-Verlag, 1999. 

[19] D. G. Luenberger, Optimization by Vector Sapce Methods . New York: Wiley, 1969. 

[20] W. Rudin, Real and Complex Analysis . McGraw-Hill Science Engineering, 1986. 

[21] T. M. Cover and J. A. Thomas, Elements of information theory . New Jersey: Wiley-Interscience, 2006. 

[22] E. Ordentlich and T. Weissman, “Approximations for the entropy rate of a hidden markov process,” in Proc. IEEE Int. Symp. Information Theory , pp. 2198 –2202, Sept. 2005. 

[23] J. Luo and D. Guo, “On the entropy rate of hidden markov processes observed through arbitrary memoryless channels,” IEEE Trans. Inf. Theory , vol. 55, pp. 1460 –1467, April 2009. 

[24] D. Blackwell, “The entropy of functions of finite-state markov chains,” in Trans. First Prague Conf. Information Theory, Statistical Decision Functions, Random Processes , (Prague, Czechoslovakia), pp. 13–20, 1957. 

