scientific article; zbMATH DE number 1247872
In this very sloppy paper some inequalities are given for Kraft numbers. This leads to some corollaries on conditions for the existence of uniquely decodable codes over an alphabet consisting of \(r\) characters and with wordlengths \(l_1,\dots, l_n\). The conditions mentioned in the corollaries are stronger than those coming from the original Kraft inequality (Theorem 1.1) and McMillan's theorem (Theorem 1.2), since they are based on them. The authors mix up terminology, for instance what they call decipherable is usually called decodable. Moreover the paper contains lots of errors, almost every formula contains one or more errors (the list given by the reviewer can be obtained from the Zbl office). Finally according to the acknowledgement the style of the paper is much ``improved, thanks to the referee but my impression is that if the referee and the authors had done their work well, style, contents and correctness could have been much improved upon.
- Varieties of codes and Kraft inequality
- scientific article; zbMATH DE number 4209605 (Why is no real title available?)
- scientific article; zbMATH DE number 5000408 (Why is no real title available?)
- Inequalities for discrete f-divergence measures: a survey of recent results
- The Kraft sum as a monotone function on the refinement-ordered set of uniquely decipherable codes
- Two inequalities implied by unique decipherability
- STACS 2005
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4228019)
