The Capacity of a Possibilistic Channel
ECSQARU '01 Proceedings of the 6th European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty
Possibilistic information theory: a coding theoretic approach
Fuzzy Sets and Systems - Possibility theory and fuzzy logic
Combinatorics, Probability and Computing
Local chromatic number and Sperner capacity
Journal of Combinatorial Theory Series B
Utilities and distortions: an objective approach to possibilistic coding
International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems
Minimum Entropy Combinatorial Optimization Problems
CiE '09 Proceedings of the 5th Conference on Computability in Europe: Mathematical Theory and Computational Practice
Improved Slepian-Wolf exponents via Witsenhausen's rate
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 2
Algorithmic design of perfectly reconstructing equalisers
International Journal of Systems, Control and Communications
Automation and Remote Control
Zero-error feedback capacity of channels with state information via dynamic programming
IEEE Transactions on Information Theory
A quantum version of Wielandt's inequality
IEEE Transactions on Information Theory
Spearman Permutation Distances and Shannon's Distinguishability
Fundamenta Informaticae
| Hi-index | 754.96 |
The problem of error-free transmission capacity of a noisy channel was posed by Shannon in 1956 and remains unsolved, Nevertheless, partial results for this and similar channel and source coding problems have had a considerable impact on information theory, computer science, and mathematics. We review the techniques, results, information measures, and challenges encountered in this ongoing quest