Zero-error information theory

From MaRDI portal
Publication:4701191

DOI10.1109/18.720537zbMath0932.94019OpenAlexW2169962394MaRDI QIDQ4701191

János Körner, Alon Orlitsky

Publication date: 21 November 1999

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/18.720537



Related Items

On the independence number of some strong products of cycle-powers, New lower bounds for the Shannon capacity of odd cycles, Conic Approach to Quantum Graph Parameters Using Linear Optimization Over the Completely Positive Semidefinite Cone, Codeword distinguishability in minimum diversity decoding, UTILITIES AND DISTORTIONS: AN OBJECTIVE APPROACH TO POSSIBILITIES CODING, A limit theorem for the Shannon capacities of odd cycles. II, On the independence numbers of the cubes of odd cycles, Local boxicity and maximum degree, Quantum capacity under adversarial quantum noise: arbitrarily varying quantum channels, Entanglement can increase asymptotic rates of zero-error classical communication over classical channels, On the Normalized Shannon Capacity of a Union, On the Shannon capacity of triangular graphs, Control and estimation under information constraints: toward a unified theory of control, computation and communications, State estimation via limited capacity noisy communication channels, The problem of stabilization of networked systems under computational power constraints, Forbiddance and capacity, Exclusivity structures and graph representatives of local complementation orbits, Minimum Entropy Combinatorial Optimization Problems, Minimum entropy combinatorial optimization problems, QUANTUM ZERO-ERROR CAPACITY, Combinatorial entropies and statistics, A limit theorem for the Shannon capacities of odd cycles I, A unified construction of semiring-homomorphic graph invariants, Local chromatic number and Sperner capacity, On zero-error codes produced by greedy algorithms, Shannon zero error capacity in the problems of state estimation and stabilization via noisy communication channels, Clique partitioning with value-monotone submodular cost, Possibilistic information theory: A coding theoretic approach