Computer Science – Information Theory
Scientific paper
2010-01-25
Computer Science
Information Theory
Scientific paper
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 proceedings): does the domain of every optimal
decompressor contain the domain of some optimal prefix-free decompressor? In
this paper we provide a negative answer to this question.
Andreev Mikhail
Razenshteyn Ilya
Shen Alexander
No associations
LandOfFree
Not Every Domain of a Plain Decompressor Contains the Domain of a Prefix-Free One does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Not Every Domain of a Plain Decompressor Contains the Domain of a Prefix-Free One, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Not Every Domain of a Plain Decompressor Contains the Domain of a Prefix-Free One will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-131276