PREFIX-FREE ŁUKASIEWICZ LANGUAGES

Ludwig Staiger · International Journal of Foundations of Computer Science · 2007

Generalised Łukasiewicz languages are simply described languages having good information-theoretic properties. An especially desirable property is the one of being a prefix code. This paper addresses the question under which conditions a generalised Łukasiewicz language is a prefix code. Moreover, an upper bound on the delay of decipherability of a generalised Łukasiewicz language is derived.

Read the paper · More papers on PaperTik