Comments on Optical Fiber Communication Channel Capacity Results of Song, Mahajan, Mahadevan, and Morris

Abstract : We report on our numerical results concerning the capacity of certain binary symmetric channels with asymmetric erasures. Plots of our numerical capacity solutions are offered in contrast to some of the existing literature.

[1]  Sang Joon Kim,et al.  A Mathematical Theory of Communication , 2006 .

[2]  Ira S. Moskowitz.  An approximation of the capacity of a simple channel , 2009, 2009 43rd Annual Conference on Information Sciences and Systems.

[3]  Ira S. Moskowitz,et al.  Noisy Timing Channels with Binary Inputs and Outputs , 2006, Information Hiding.

[4]  Suguru Arimoto,et al.  An algorithm for computing the capacity of arbitrary discrete memoryless channels , 1972, IEEE Trans. Inf. Theory.

[5]  Richard E. Blahut,et al.  Computation of channel capacity and rate-distortion functions , 1972, IEEE Trans. Inf. Theory.

[6]  Robert B. Ash,et al.  Information Theory , 2020, The SAGE International Encyclopedia of Mass Media and Society.

[7]  Thomas M. Cover,et al.  Elements of Information Theory , 2005 .

[8]  Jan van de Plaats,et al.  Fundamentals Of Optical Fiber Communications , 1990 .

[9]  Ira S. Moskowitz.  Approximations for the capacity of binary input discrete memoryless channels , 2010, 2010 44th Annual Conference on Information Sciences and Systems (CISS).