IJPAM: Volume 96, No. 3 (2014)
FOR THE DEVELOPMENT OF SOURCE CODING THEOREMS
Department of Mathematics
Guru Nanak Dev University
Amritsar, 143005, INDIA
Abstract. The present communication deals with the development of new coding theorems in terms of channel equivocation, that is, coding is done for a source which selects a new set of source statistics after each output symbol is received from the channel. New proof for Fano's bound on Shannon's equivocation is provided by using log sum inequality. Moreover, bounds on various generalizations of Shannon's equivocation have been provided.
Received: March 5, 2014
AMS Subject Classification: 94A24, 94A15, 94A29
Key Words and Phrases: entropy, source coding, uniquely decipherable code, instantaneous code, Kraft's Inequality, equivocation, Jensen's inequality, Log Sum inequality
Download paper from here.
DOI: 10.12732/ijpam.v96i3.2 How to cite this paper?
Source: International Journal of Pure and Applied Mathematics
ISSN printed version: 1311-8080
ISSN on-line version: 1314-3395
Pages: 307 - 322