A Non-linear Dynamical Systems' Proof of Kraft-McMillan Inequality and its Converse
Nithin Nagaraj
TL;DR
This paper presents a novel proof of the Kraft-McMillan inequality and its converse using non-linear dynamical systems, offering a new perspective on fundamental information theory results.
Contribution
It introduces a dynamical systems approach to prove the Kraft-McMillan inequality and its converse, providing a fresh theoretical perspective.
Findings
Dynamical systems provide a valid proof framework for Kraft-McMillan inequality.
The approach confirms the necessary and sufficient conditions for uniquely decodable codes.
New insights into the connection between dynamical systems and information theory.
Abstract
In this short paper, we shall provide a dynamical systems' proof of the famous Kraft-McMillan inequality and its converse. Kraft-McMillan inequality is a basic result in information theory which gives a necessary and sufficient condition for the lengths of the codewords of a code to be uniquely decodable.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsStability and Control of Uncertain Systems · Optimization and Variational Analysis · Point processes and geometric inequalities