Development of two new mean codeword lengths

Two new mean codeword lengths L(α,β) and L(β) are defined and it is shown that these lengths satisfy desirable properties as a measure of typical codeword lengths. Consequently two new noiseless coding theorems subject to Kraft’s inequality have been proved. Further, we have shown that the mean code...

Full description

Saved in:
Bibliographic Details
Published inInformation sciences Vol. 207; pp. 90 - 97
Main Authors Parkash, Om, Kakkar, Priyanka
Format Journal Article
LanguageEnglish
Published Elsevier Inc 10.11.2012
Subjects
Best 1:1 code
Coding
Entropy
Inequalities
Mean codeword length
Theorems
Uniquely decipherable code
Best 1:1 code
Uniquely decipherable code
Entropy
Mean codeword length
Online AccessGet full text
ISSN0020-0255
1872-6291
DOI10.1016/j.ins.2012.04.020

Cover

More Information
Summary:Two new mean codeword lengths L(α,β) and L(β) are defined and it is shown that these lengths satisfy desirable properties as a measure of typical codeword lengths. Consequently two new noiseless coding theorems subject to Kraft’s inequality have been proved. Further, we have shown that the mean codeword lengths L1:1(α,β) and L1:1(β) for the best one-to-one code (not necessarily uniquely decodable) are shorter than the mean codeword length LUD(α,β) and LUD(β) respectively for the best uniquely decodable code by no more than logDlogDn+3 for D=2. Moreover, we have studied tighter bounds of L(α,β).
Bibliography:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ISSN:0020-0255
1872-6291
DOI:10.1016/j.ins.2012.04.020