On variable-length-to-block coding

Variable-length-to-block codes are a generalization of run-length codes. A coding theorem is first proved. When the codes are used to transmit information from fixed-rate sources through fixed-rate noiseless channels, buffer overflow results. The latter phenomenon is an important consideration in th...

Full description

Saved in:
Bibliographic Details
Published inIEEE transactions on information theory Vol. 18; no. 6; pp. 765 - 774
Main Authors Jelinek, F., Schneider, K.
Format Journal Article
LanguageEnglish
Published IEEE 01.11.1972
Subjects
Buffer overflows
Channel coding
Codes
Complexity theory
Data compression
Decoding
Entropy
Random variables
Symbols
Terminology
Online AccessGet full text
ISSN0018-9448
1557-9654
DOI10.1109/TIT.1972.1054899

Cover

More Information
Summary:Variable-length-to-block codes are a generalization of run-length codes. A coding theorem is first proved. When the codes are used to transmit information from fixed-rate sources through fixed-rate noiseless channels, buffer overflow results. The latter phenomenon is an important consideration in the retrieval of compressed data from storage. The probability of buffer overflow decreases exponentially with buffer length and we determine the relation between rate and exponent size for memoryless sources. We obtain codes that maximize the overflow exponent for any given transmission rate exceeding the source entropy and present asymptotically optimal coding algorithms whose complexity grows linearly with codeword length. It turns out that the optimum error exponents of variable-length-to-block coding are identical with those of block-to-variable-length coding and are related in an interesting way to Renyi's generalized entropy function.
Bibliography:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ISSN:0018-9448
1557-9654
DOI:10.1109/TIT.1972.1054899