On Non-Additive Measures of Inaccuracy and A Coding Theorem

From MaRDI portal





For a pair of distributions, Kerridge introduced a quantity known as inaccuracy and proved the noiseless coding theorems for personal probability codes. The noiseless coding theorems for non-additive measures of inaccuracy are established in a very simple way.











This page was built for publication: On Non-Additive Measures of Inaccuracy and A Coding Theorem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3764049)