Journal Papers


[J70] Capacity-achieving Probability Measure for Conditionally Gaussian Channels with Bounded Inputs
T. H. Chan, S. Hranilovic, and F. R. Kschischang, IEEE Trans. Info. Theory, vol. 51, pp. 2073–2088, Jun. 2005. doi: 10.1109/TIT.2005.847707

[J77] Capacity Bounds for Power- and Band-Limited Optical Intensity Channels Corrupted by Gaussian Noise
S. Hranilovic and F. R. Kschischang, IEEE Trans. Info. Theory, vol. 50, pp. 784–795, May 2004. doi: 10.1109/TIT.2004.826649

Conference Papers


[C17] Upper Bound on the Capacity of the Nonlinear Schroedinger Channel
M. I. Yousefi, G. Kramer, and F. R. Kschischang, in Proc. 14th Canadian Workshop on Information Theory, Memorial University, St. John’s, NL, Jul. 6, 2015–Jul. 9, 2015, pp. 22–26. doi: 10.1109/CWIT.2015.7255144

[C20] Upper Bound on the Capacity of a Cascade of Nonlinear and Noisy Channels
G. Kramer, M. I. Yousefi, and F. R. Kschischang, in Proc. IEEE Information Theory Workshop, Jerusalem, Israel, Apr. 26–May 1, 2015, pp. 1–4. doi: 10.1109/ITW.2015.7133167

[C75] Efficient Variable Length Channel Coding for Unknown DMCs
S. C. Draper, B. J. Frey, and F. R. Kschischang, in Proc. IEEE Int. Symp. on Info. Theory, Chicago, IL, Jun. 27, 2004–Jul. 2, 2004, p. 379. doi: 10.1109/ISIT.2004.1365416

[C76] On Interacting Encoders and Decoders in Multiuser Settings
S. C. Draper, B. J. Frey, and F. R. Kschischang, in Proc. IEEE Int. Symp. on Info. Theory, Chicago, IL, Jun. 27, 2004–Jul. 2, 2004, p. 118. doi: 10.1109/ISIT.2004.1365155

[C78] On the Discreteness of the Capacity-achieving Probability Measure of Signal-Dependent Gaussian Channels
T. H. Chan and F. R. Kschischang, in Proc. IEEE Int. Symp. on Info. Theory, Chicago, IL, Jun. 27, 2004–Jul. 2, 2004, p. 347. doi: 10.1109/ISIT.2004.1365384

[C84] Interactive Decoding of a Broadcast Message
S. C. Draper, B. J. Frey, and F. R. Kschischang, in Proc. 41st Annual Allerton Conf. on Commun., Control and Computing, Allerton House, Monticello, IL, Oct. 1, 2003–Oct. 3, 2003.

[C85] Capacity-Achieving Probability Measure of an Input-Bounded Optical Channel with Signal-Dependent Noise
T. H. Chan and F. R. Kschischang, in Proc. 41st Annual Allerton Conf. on Commun., Control and Computing, Allerton House, Monticello, IL, Oct. 1, 2003–Oct. 3, 2003.

[C87] Capacity-achieving Probability Measure of an Input-bounded Vector Gaussian Channel
T. H. Chan, S. Hranilovic, and F. R. Kschischang, in Proc. IEEE Int. Symp. on Info. Theory, Yokohama, Japan, Jun. 29, 2003–Jul. 4, 2003, p. 371. doi: 10.1109/ISIT.2003.1228387

[C93] On the Discreteness of the Capacity-Achieving Measure of an Input-Bounded Vector Gaussian Channel
T. H. Chan, S. Hranilovic, and F. R. Kschischang, in Proc. 8th Canadian Workshop on Information Theory, University of Waterloo, Waterloo, ON, May 18, 2003–May 21, 2003.

[C95] Capacity Bounds for Power- and Band-Limited Wireless Infrared Channels Corrupted by Gaussian Noise
S. Hranilovic and F. R. Kschischang, in Proc. 40th Annual Allerton Conf. on Commun., Control and Computing, Allerton House, Monticello, IL, Oct. 2, 2002–Oct. 4, 2002.

[C100] Upper and Lower Bounds on the Capacity of Optical Intensity Channels Corrupted by Gaussian Noise
S. Hranilovic and F. R. Kschischang, in Proc. 21st Biennial Symp. Commun., Queen’s University, Kingston, ON, Jun. 2002.

Updated: Mon Jan 20 17:04:17 EST 2020

home
 © Frank R. Kschischang | about