download582 view1,367
twitter facebook

CC_BYThis item is licensed Creative Commons License

dc.contributor.author
Ashiq Hussain Bhat
dc.contributor.author
M. A. K. Baig
dc.date.accessioned
2018-10-19T07:17:48Z
dc.date.available
2018-10-19T07:17:48Z
dc.date.issued
2016-12-30
dc.identifier.issn
2287-4577
dc.identifier.uri
https://repository.kisti.re.kr/handle/10580/9402
dc.description.abstract
In this paper we define a two parametric new generalized useful average code-word length (P;U) and its relationship with two parametric new generalized useful information measure (P;U) has been discussed. The lower and upper bound of (P;U), in terms of (P;U) are derived for a discrete noiseless channel. The measures defined in this communication are not only new but some well known measures are the particular cases of our proposed measures that already exist in the literature of useful information theory. The noiseless coding theorems for discrete channel proved in this paper are verified by considering Huffman and Shannon-Fano coding schemes on taking empirical data. Also we study the monotonic behavior of (P;U) with respect to parameters and . The important properties of (P;U) have also been studied.
dc.format
application/pdf
dc.language
eng
dc.publisher
한국과학기술정보연구원 과학기술정보센터
dc.publisher
Korea Institute of Science and Technology Information
dc.relation.ispartofseries
Journal of Information Science Theory and Practice
dc.title
Characterization of New Two Parametric Generalized Useful Information Measure
dc.type
Article
dc.rights.license
CC_BY
dc.identifier.doi
10.1633/JISTaP.2016.4.4.5
dc.citation.endPage
74
dc.citation.number
4
dc.citation.startPage
64
dc.citation.volume
4
dc.contributor.affiliation
Post Graduate Department of Statistics University of Kashmir
dc.identifier.bibliographicCitation
vol. 4, no. 4, page. 64 - 74
dc.subject.keyword
Shannon's entropy
dc.subject.keyword
codeword length
dc.subject.keyword
useful information measure
dc.subject.keyword
Kraft inequality
dc.subject.keyword
Holder's inequality
dc.subject.keyword
Huffman codes
dc.subject.keyword
Shannon-Fano codes
dc.subject.keyword
Noiseless coding theorem
dc.rights.holder
KISTI
Appears in Collections:
8. KISTI 간행물 > JISTaP > Vol. 4 - No. 4
Files in This Item:
Thumbnail E1JSCH_2016_v4n4_64.pdf2.02 MBDownload

Browse