ON SOME INEQUALITIES AND GENERALIZED ENTROPIES: A UNIFIED APPROAC

RM Capocelli, IJ Taneja - Cybernetics and System, 1985 - Taylor & Francis
Some inequalities useful in information theory are considered and extended for various
generalized entropies. The extension is done under a unified approach. Some possible …

A short note on the redundancy of degree α

IJ Taneja - Information sciences, 1986 - Elsevier
It is known that there always exists an instantaneous, uniquely decodable code such that the
redundancy of the discrete source is bounded between 0 and 1. Johnsen [5] provided …

Inaccuracy and the best 1: 1 code

PK Bhatia, HC Taneja, RK Tuteja - Microelectronics Reliability, 1993 - Elsevier
The expected codeword length L UD of the best uniquely decodable (UD) code satisfies H
(P; Q)≤ L UD< H (P; Q)+ 1, where H (P; Q) is the Kerridge inaccuracy. By applying the idea …

Some Source Coding Theorems and 1:1 Coding Based on Generalized Inaccuracy Measure of Order and Type

S Kumar, A Choudhary, A Kumar - Communications in Mathematics and …, 2014 - Springer
In this paper, we have established some noiseless coding theorems for a generalized
parametric 'useful'inaccuracy measure of order α α and type β β and generalized mean …

Their Applications

IJ TANEJA - Advances in Electronics and Electron Physics, 1989 - books.google.com
Generalized Distance Measures.---Generalized Measures of Directed Divergence..
Generalized Divergence Measures. A. Information Radius and the J-Divergence. B …

Upper bounds on exponentiated expected length of optimal one-to-one codes

J Cheng, TK Huang - Proceedings of the 2006 international conference …, 2006 - dl.acm.org
In this paper, we consider an exponentially weighted average codeword length introduced
by Campbell as a performance measure for source codes. This criterion assumes that the …