Hostname: page-component-74656f9884-rdgjk Total loading time: 0 Render date: 2026-11-08T12:50:17.459Z Has data issue: false hasContentIssue false

On a generalized entropy and a coding theorem

Published online by Cambridge University Press:  14 July 2016

Pushpa N. Rathie*
Affiliation:
Queen's University, Kingston, Ontario

Extract

Let P= {p 1,···, PN } be a finite discrete probability distribution. Then the entropy of the distribution P, introduced by Shannon [12], is defined as Throughout this paper ∑ will stand for and logarithms will be taken to the base D (D > 1).

Information

Type
Research Papers
Copyright
Copyright © Applied Probability Trust 

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable