Abstract. Muroga [M52] showed how to express the Shannon channel capacity of a discrete channel with noise [S49] as an explicit function of the transition probabilities. His method accommodates channels with any finite number of input symbols, any finite number of output symbols and any transition probability matrix. Silverman [S55] carried out Muroga’s method in the special case of a binary ch...

| In this paper, we survey faster-than-Nyquist (FTN) signaling, an extension of ordinary linear modulation in which the usual data bearing pulses are simply sent faster, and consequently are no longer orthogonal. Far from a disadvantage, this innovation can transmit up to twice the bits as ordinary modulation at the same bit energy, spectrum, and error rate. The method is directly applicable to...

The identification capacity is the maximal iterated logarithm of the number of messages divided by the blocklength that can be reliably transmitted when the receiver is only interested in deciding whether a specific message was transmitted or not. The identification coding theorem of Ahlswede and Dueck for single-user discrete memoryless channels states that the identification capacity is equal...

Memoryless channels with deletion errors as defined by a stochastic channel matrix allowing for bit drop outs are considered in which transmitted bits are either independently deleted with probability d or unchanged with probability 1 − d. Such channels are information stable, hence their Shannon capacity exists. However, computation of the channel capacity is formidable, and only some upper an...

Security constraint results in rate-loss in wiretap channels. In this paper we propose a coding scheme for two user Multiple Access Channel with Wiretap (MAC-WT), where previous messages are used as a key to enhance the secrecy rates of both the users until we achieve the usual capacity region of a Multiple Access Channel (MAC) without the wiretapper (Shannon capacity region). With this scheme ...

For deep CNN-based image classification models, we observe that confusions between classes with high visual similarity are much stronger than those where classes are visually dissimilar. With these unbalanced confusions, classes can be organized in communities, which is similar to cliques of people in the social network. Based on this, we propose a graph-based tool named “confusion graph” to qu...

The classic Shannon-Hartley law suggests that the achievable channel capacity increases logarithmically with the transmit power. By contrast, the MIMO capacity increases linearly with the number of transmit antennas, provided that the number of receive antennas is equal to the number of transmit antennas. With the further proviso that the total transmit power is increased proportionately to the...

It follows from a construction for independent sets in the powers of odd cycles given in the predecessor of this paper that the limit as k goes to infinity of k+ 1/2−Θ(C2k+1) is zero, where Θ(G) is the Shannon capacity of a graph G. This paper contains a shorter proof of this limit theorem that is based on an ‘expansion process’ introduced in an older paper of L. Baumert, R. McEliece, E. Rodemi...

The conventional definitions of the source coding rate and of channel capacity require the existence of reliable codes for all sufficiently large block lengths. Alternatively, if it is required that good codes exist for infinitely many block lengths, then optimistic definitions of source coding rate and channel capacity are obtained. In this work, formulas for the optimistic minimum achievable ...

Let D ⊆ N be an arbitrary subset of the natural numbers. For every n, let M(n,D) be the maximum of the cardinality of a set of Hamiltonian paths in the complete graph Kn such that the union of any two paths from the family contains a not necessarily induced cycle of some length from D. We determine or bound the asymptotics of M(n,D) in various special cases. This problem is closely related to t...