Open AccessSome coding theorem on generalized Havrda-Charvat and Tsallis's entropy
Author(s) -
Satish Kumar,
Arun Choudhary
Publication year - 2012
Publication title -
tamkang journal of mathematics
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.324
H-Index - 18
eISSN - 0049-2930
pISSN - 2073-9826
DOI - 10.5556/j.tkjm.43.2012.711
Subject(s) - mathematics , tsallis entropy , entropy (arrow of time) , beta (programming language) , discrete mathematics , pure mathematics , combinatorics , mathematical analysis , tsallis statistics , quantum mechanics , physics , computer science , programming language
A new measure $L_{alpha }^{eta } $, called average code word length of order $alpha $ and type $eta $ has been defined and its relationship with a result of generalized Havrda-Charvat and Tsallis's entropy has been discussed. Using $L_{alpha }^{eta } $,some coding theorem for discrete noiseless channel has been proved