261 citations · 836 across the 30 of their papers we have counts for
Showing cs.ITShow all
2 papers · 1 filter
cs.IT2011★ 1 cited
Common information revisited
Ilya Razenshteyn
One of the main notions of information theory is the notion of mutual information in two messages (two random variables in Shannon information theory or two binary strings in algor…
cs.IT2010
Not Every Domain of a Plain Decompressor Contains the Domain of a Prefix-Free One
Mikhail Andreev, Ilya Razenshteyn, Alexander Shen
C.Calude, A.Nies, L.Staiger, and F.Stephan posed the following question about the relation between plain and prefix Kolmogorov complexities (see their paper in DLT 2008 conference…