Noiseless Coding Theo rems Connected with Tuteja and Bhaker's 'useful' Inaccuracy Measure
inaccuracy measure, average code length, holders inequality
Abstract
A new measure, called average code word length of order and type has been defined and its relationship with a result of Tuteja and Bhaker 'useful' inaccuracy measure has been discussed. Using , some noiseless coding theorems for discrete noiseless channel has been proved. The results obtained in this paper generalizes some well known results available in the literature.
Downloads
- Article PDF
- TEI XML Kaleidoscope (download in zip)* (Beta by AI)
- Lens* NISO JATS XML (Beta by AI)
- HTML Kaleidoscope* (Beta by AI)
- DBK XML Kaleidoscope (download in zip)* (Beta by AI)
- LaTeX pdf Kaleidoscope* (Beta by AI)
- EPUB Kaleidoscope* (Beta by AI)
- MD Kaleidoscope* (Beta by AI)
- FO Kaleidoscope* (Beta by AI)
- BIB Kaleidoscope* (Beta by AI)
- LaTeX Kaleidoscope* (Beta by AI)
How to Cite
References
C. Arndt (2001) Arndt, C, "Information measure -information and its description in science and Engineering.
R. Autar, R. Soni (1997) Inaccuracy and a coding theorem. 12.
R. Tuteja (1989) On coding theorem connected with 'useful' entropy of order- β. 12(1), 193-198.
D. Kerridge (1961) Inaccuracy and Inference. 23(1), 184-194. https://doi.org/10.1111/j.2517-6161.1961.tb00404.x
B. Khan, B. Bhat, S. Pirzda Some results on a generalized useful information measure.
Published
2014-02-25
Issue
Section
License
Copyright (c) 2014 Authors and Global Journals Private Limited
This work is licensed under a Creative Commons Attribution 4.0 International License.