On the construction of statistically synchronizable codes

The problem of constructing statistically synchronizable codes over arbitrary alphabets and for any finite source is considered. It is shown how to efficiently construct a statistically synchronizable code whose average codeword length is within the least likely codeword probability from that of the...

Full description

Saved in:
Bibliographic Details
Published inIEEE transactions on information theory Vol. 38; no. 2; pp. 407 - 414
Main Authors Capocelli, R.M., De Santis, A.A., Gargano, L., Vaccaro, U.
Format Journal Article
LanguageEnglish
Published IEEE 01.03.1992
Subjects
Binary codes
Councils
Decoding
Delay
H infinity control
Information theory
Probability distribution
Random variables
Redundancy
Online AccessGet full text

Cover

More Information
Summary:The problem of constructing statistically synchronizable codes over arbitrary alphabets and for any finite source is considered. It is shown how to efficiently construct a statistically synchronizable code whose average codeword length is within the least likely codeword probability from that of the Huffman code for the same source. Moreover, a method is given for constructing codes having a synchronizing codeword. The method yields synchronous codes that exhibit high synchronizing capability and low redundancy.< >
Bibliography:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ISSN:0018-9448
1557-9654
DOI:10.1109/18.119696