Abstract—A brief chronicle is given of the historical development of the central problems in the theory of fundamental limits of data compression and reliable communication.
We define a class of “algebraic” random matrix channels for which one can generically compute the limiting Shannon transform using numerical techniques and often enumerate th...
For an undirected graph G = (V, E), let Gn denote the graph whose vertex set is V n in which two distinct vertices (u1, u2, . . . , un) and (v1, v2, . . . , vn) are adjacent iff ...
Abstract. Starting from the Shannon channel capacity, we propose an IRUWB channel capacity based on the delay spread for multipath time variant channels. This IR-UWB channel capaci...
Aubin Lecointre, Daniela Dragomirescu, Robert Plan...
The entanglement-assisted classical capacity of a noisy quantum channel ( ) is the amount of information per channel use that can be sent over the channel in the limit of many uses...
Charles H. Bennett, Peter W. Shor, John A. Smolin,...