Noiseless Coding Theorems Connected with Tuteja and Bhakers useful Inaccuracy Measure
Keywords:
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
Rayees Ahmad Dar. (2014). Noiseless Coding Theorems Connected with Tuteja and Bhakers useful Inaccuracy Measure. Global Journal of Science Frontier Research, 14(F1), 115–122. Retrieved from https://journalofscience.org/index.php/GJSFR/article/view/1245
Published
2014-01-15
Issue
Section
Articles
License
Copyright (c) 2014 Authors and Global Journals Private Limited
This work is licensed under a Creative Commons Attribution 4.0 International License.