A Study on the Generalized Fuzzy Mean Codeword Lengths

Authors

  • D. S. Hooda Mathematics, GJ university of Science and Technology, Hisar-125001, India.
  • Divya Jain Department of Mathematics, Jaypee University of Engineering and Technology, Guna-473001, India.

DOI:

https://doi.org/10.9734/bpi/ctmcs/v6/3167F

Keywords:

Entropy, fuzzy entropy, codeword length, decipherable code, crisp set, holder’s inequality

Abstract

Information Theory has ideas which are widely applicable to the situations remote from its original inspiration. Although, the applicability of ideas is not always exact; yet these are very useful. One of the best applications of information measure is noiseless coding theorem which provides the bounds for suitable encoding of entropies and fuzzy information measures.

In present chapter, mean code word and fuzzy mean codeword lengths are defined, and some generalizations of mean codeword length are also described. A generalized fuzzy mean codeword length of degree \(\beta\) is defined and its bounds in the term of a generalized fuzzy information measure are studied. Further, the fuzzy mean codeword length of type (\(\alpha\), \(\beta\)) is introduced and its bounds are studied. Monotonic behavior of these fuzzy mean codeword lengths is illustrated graphically by taking some empirical data.

Published

2021-07-21

How to Cite

D. S. Hooda, & Divya Jain. (2021). A Study on the Generalized Fuzzy Mean Codeword Lengths. Current Topics on Mathematics and Computer Science Vol. 6, 81–95. https://doi.org/10.9734/bpi/ctmcs/v6/3167F