Publication Type:

Journal Article

Source:

Chaos, Volume 19, Number 1 (2009)

URL:

http://www.scopus.com/inward/record.url?eid=2-s2.0-63849310218&partnerID=40&md5=a1ffb5f960850f8b3af6159a771c6bbb

Abstract:

Uniquely decodable codes are central to lossless data compression in both classical and quantum communication systems. The Kraft-McMillan inequality is a basic result in information theory which gives a necessary and sufficient condition for a code to be uniquely decodable and also has a quantum analogue. In this letter, we provide a novel dynamical systems proof of this inequality and its converse for prefix-free codes (no codeword is a prefix of another-the popular Huffman codes are an example). For constrained sources, the problem is still open. © 2009 American Institute of Physics.

Notes:

cited By (since 1996)2

Cite this Research Publication

N. Nagaraj, “A dynamical systems proof of Kraft-McMillan inequality and its converse for prefix-free codes”, Chaos, vol. 19, 2009.