An application of generalized Tsalli’s-Havrda-Charvat entropy in coding theory through a generalization of Kraft inequality

Abstract

A parametric mean length is defined as the quantity , where α > 0 (≠ 1), β > 0, ui > 0, D > 1 is an integer, Σ pi = 1. This being the useful mean length of code words weighted by utilities, ui. Lower and Upper bounds form αβLu are derived in terms of ‘useful’ Tsalli’s-Havrda-Charvat information measure for power probability distribution Pβi.