# A Mathematical Theory of Communication

@inproceedings{Shin2006AMT, title={A Mathematical Theory of Communication}, author={Jin Shin and Sang Joon Kim}, year={2006} }

This paper opened the new area the information theory. Before this paper, most people believed that the only way to make the error probability of transmission as small as desired is to reduce the data rate (such as a long repetition scheme). However, surprisingly this paper revealed that it does not need to reduce the data rate for achieving that much of small errors. It proved that we can get some positive data rate that has the same small error probability and also there is an upper bound of… Expand

#### 44,748 Citations

The birthday problem and zero-error list codes

- Computer Science, Mathematics
- 2017 IEEE International Symposium on Information Theory (ISIT)
- 2017

This paper studies the performance of randomly generated codebooks over discrete memoryless channels under a zero-error constraint and leads to an information-theoretic formulation of the birthday problem, which is concerned with the probability that in a given population, a fixed number of people have the same birthday. Expand

Error Probability Analysis of Binary Asymmetric Channels

- 2010

In his world-famous paper of 1948, Shannon defined channel capacity as the ultimate rate at which information can be transmitted over a communication channel with an error probability that will… Expand

Fundamental Limits of Communication With Low Probability of Detection

- Computer Science, Mathematics
- IEEE Transactions on Information Theory
- 2016

This paper considers the problem of communication over a discrete memoryless channel (DMC) or an additive white Gaussian noise (AWGN) channel subject to the constraint that the probability that an… Expand

Limits of low-probability-of-detection communication over a discrete memoryless channel

- Computer Science, Mathematics
- 2015 IEEE International Symposium on Information Theory (ISIT)
- 2015

This paper considers the problem of communication over a discrete memoryless channel subject to the constraint that the probability that an adversary who observes the channel outputs can detect the… Expand

Information Theory Tutorial Communication over Channels with memory

- 2005

A general capacity formula C = sup X I(X; Y), which is correct for arbitrary single-user channels without feedback, is introduced in this tutorial. This new capacity formula is obtained by using a… Expand

Channel Coding

- Video Coding for Wireless Communication Systems
- 2018

Prior to Shannon results, it was belived that the error proba bility of the channel communication in Figure 1, grows asR grows, whereR is the rate transmitted through the channel, i.e., the number of… Expand

Uncomputability of the generalized capacity

- Mathematics, Computer Science
- ArXiv
- 2016

It is shown that there is no equivalent to the Blahut-Arimoto algorithm for computing the generalized capacity of a channel and that such an algorithm can not exist. Expand

On the Power of Feedback in Interactive Channels

- 2013

In classical information theory it is well-known that feedback does not improve the channel capacity. We demonstrate that this is not the case in the interactive setting by developing a new coding… Expand

On Bounds for E-Capacity of DMC

- Mathematics, Computer Science
- IEEE Trans. Inf. Theory
- 2007

This paper summarizes and revises the results of previous hardly accessible publications of the author and summarizes the method of types and graph decomposition for E-capacity of discrete memoryless channel (DMC). Expand

Information-theoretic aspects of optical communications

- Computer Science
- 2011

New upper and lower bounds on the amount of classical information that can be transmitted through a single use of a quantum channel, under a constraint on the average error probability are proved. Expand