The zero-error side information problem and chromatic numbers (Corresp.)
From MaRDI portal
Publication:4103444
DOI10.1109/TIT.1976.1055607zbMath0336.94015OpenAlexW2071801393MaRDI QIDQ4103444
Publication date: 1976
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/tit.1976.1055607
Related Items (14)
On variable length coding with side information for discrete memoryless sources ⋮ Information theoretic parameters of noncommutative graphs and convex corners ⋮ Transforming monitoring structures with resilient encoders -- application to repeated games ⋮ Multiple-user communication ⋮ Secure non-interactive reducibility is decidable ⋮ Asymptotic values of the Hall-ratio for graph powers ⋮ A new property of the Lovász number and duality relations between graph parameters ⋮ Private information structures ofAwith respect toB ⋮ A distributed computing perspective of unconditionally secure information transmission in Russian cards problems ⋮ A distributed computing perspective of unconditionally secure information transmission in Russian cards problems ⋮ Minimum entropy coloring ⋮ Probabilistic refinement of the asymptotic spectrum of graphs ⋮ Topological bounds on the dimension of orthogonal representations of graphs ⋮ On the ultimate lexicographic Hall-ratio
This page was built for publication: The zero-error side information problem and chromatic numbers (Corresp.)
