Creating order in sequence spaces with simple machines
Information and Computation
On the upper bound of the size of the r-cover-free families
Journal of Combinatorial Theory Series A
On the difference between asymptotically good packings and coverings
European Journal of Combinatorics
Journal of Combinatorial Theory Series A
The computer and the brain
A mathematical theory of communication
ACM SIGMOBILE Mobile Computing and Communications Review
Advances in Digital Image Processing for Document Reproduction
VLSI Engineering: Beyond Software Engineering
Some complexity questions related to distributive computing(Preliminary Report)
STOC '79 Proceedings of the eleventh annual ACM symposium on Theory of computing
General Theory of Information Transfer and Combinatorics (Lecture Notes in Computer Science)
General Theory of Information Transfer and Combinatorics (Lecture Notes in Computer Science)
General Theory of Information Transfer and Combinatorics
Large families of pseudorandom sequences of k symbols and their complexity: part II
General Theory of Information Transfer and Combinatorics
On concepts of performance parameters for channels
General Theory of Information Transfer and Combinatorics
Erasure, list, and detection zero-error capacities for low noise and a relation to identification
IEEE Transactions on Information Theory
Identification via compressed data
IEEE Transactions on Information Theory
Information and control: matching channels
IEEE Transactions on Information Theory
New converses in the theory of identification via channels
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory
Identification in the presence of feedback-a discovery of new capacity formulas
IEEE Transactions on Information Theory
Nonrandom binary superimposed codes
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory
Random coding theorems for the general discrete memoryless broadcast channel
IEEE Transactions on Information Theory
An achievable rate region for the broadcast channel
IEEE Transactions on Information Theory
General broadcast channels with degraded message sets
IEEE Transactions on Information Theory
Good codes can be produced by a few permutations
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory
A perspective on multiaccess channels
IEEE Transactions on Information Theory
Hypothesis testing with communication constraints
IEEE Transactions on Information Theory
New results in the theory of identification via channels
IEEE Transactions on Information Theory
Common randomness in information theory and cryptography. I. Secret sharing
IEEE Transactions on Information Theory
Approximation theory of output statistics
IEEE Transactions on Information Theory
New directions in the theory of identification via channels
IEEE Transactions on Information Theory
General Theory of Information Transfer and Combinatorics
General Theory of Information Transfer and Combinatorics
General Theory of Information Transfer and Combinatorics
Watermarking identification codes with related topics on common randomness
General Theory of Information Transfer and Combinatorics
Huge size codes for identification via a multiple access channel under a word-length constraint
General Theory of Information Transfer and Combinatorics
General Theory of Information Transfer and Combinatorics
On logarithmically asymptotically optimal testing of hypotheses and identification
General Theory of Information Transfer and Combinatorics
General Theory of Information Transfer and Combinatorics
On concepts of performance parameters for channels
General Theory of Information Transfer and Combinatorics
Secrecy results for compound wiretap channels
Problems of Information Transmission
Identification via quantum channels
Information Theory, Combinatorics, and Search Theory
How to read a randomly mixed up message
Information Theory, Combinatorics, and Search Theory
Search when the lie depends on the target
Information Theory, Combinatorics, and Search Theory
Information Theory, Combinatorics, and Search Theory
Bibliography of publications by Rudolf Ahlswede
Information Theory, Combinatorics, and Search Theory
| Hi-index | 0.04 |
We report on ideas, problems and results, which occupied us during the past decade and which seem to extend the frontiers of information theory in several directions. The main contributions concern information transfer by channels. There are also new questions and some answers in new models of source coding. While many of our investigations are in an explorative state, there are also hard cores of mathematical theories. In particular we present a unified theory of information transfer, which naturally incorporates Shannon's theory of information transmission and the theory of identification in the presence of noise as extremal cases. It provides several novel coding theorems. On the source coding side we introduce data compression for identification. Finally we are led beyond information theory to new concepts of solutions for probabilistic algorithms. The original paper [R. Ahlswede, General theory of information transfer, Preprint 97-118, SFB 343 Diskrete Strukturen in der Mathematik, Universitat Bielefeld, 1997] gave to and received from the ZIF-project essential stimulations which resulted in contributions added as GTIT-Supplements ''Search and channels with feedback'' and ''Noiseless coding for multiple purposes: a combinatorial model''. Other contributions-also to areas initiated-are published in the recent book [R. Ahlswede et al. (Eds.), General Theory of Information Transfer and Combinatorics, Lecture Notes in Computer Science, vol. 4123, Springer, Berlin, 2006]. The readers are advised to study always the pioneering papers in a field-in this case the papers [R. Ahlswede, G. Dueck, Identification via channels, IEEE Trans. Inform. Theory 35 (1989) 15-29; R. Ahlswede, G. Dueck, Identification in the presence of feedback-a discovery of new capacity formulas, IEEE Trans. Inform. Theory 35 (1989) 30-39] on identification. It is not only the most rewarding way to come to new ideas, but it also helps to more quickly grasp the more advanced formalisms without going through too many technicalities. Perhaps also the recent Shannon Lecture [R. Ahlswede, Towards a General Theory of Information Transfer, Shannon Lecture at ISIT in Seattle 13th July 2006, IEEE Information Theory Society Newsletter, 2007], aiming at an even wider scope, gives further impetus.