A general minimum-redundancy source-coding algorithm

An algorithm for the minimum-redundancy encoding of a discrete information source is proposed. In the case of memoryless sources it is shown that the theoretical compression can be appmached within any desired threshold without the burden of alphabet extensions (i.e., the encodhg of blocks of L prim...

Full description

Saved in:
Bibliographic Details
Published inIEEE transactions on information theory Vol. 26; no. 1; pp. 15 - 25
Main Author Guazzo, M.
Format Journal Article
LanguageEnglish
Published IEEE 01.01.1980
Subjects
Codes
Complexity theory
Decoding
Encoding
Entropy
Lower bound
Probability
Source coding
Symbols
Transforms
Online AccessGet full text
ISSN0018-9448
1557-9654
DOI10.1109/TIT.1980.1056143

Cover

More Information
Summary:An algorithm for the minimum-redundancy encoding of a discrete information source is proposed. In the case of memoryless sources it is shown that the theoretical compression can be appmached within any desired threshold without the burden of alphabet extensions (i.e., the encodhg of blocks of L primary symbols) and also irrespective of 1) the primary and secondary alphabet sizes 2) the numerical values of primary symbol probabillties, and 3) the order and structure of the encoding tree. The same algorithm is then extended to sources with memory and to cases in which there is a constraint on the statistical description of the secondary sequence (e.g., secondary symbol probabilities are given). The technique can thus be used to transform any given discrete source into any other given discrete source while minimizing the ratio of average secondary sequence length to average primary sequence length.
Bibliography:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ISSN:0018-9448
1557-9654
DOI:10.1109/TIT.1980.1056143