Title :
On the construction of statistically synchronizable codes
Author :
Capocelli, R.M. ; De Santis, A.A. ; Gargano, L. ; Vaccaro, U.
Author_Institution :
Dept. of Math., Rome Univ., Italy
fDate :
3/1/1992 12:00:00 AM
Abstract :
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.<>
Keywords :
codes; synchronisation; Huffman code; arbitrary alphabets; average codeword length; code construction; finite source; high synchronizing capability; least likely codeword probability; low redundancy; statistically synchronizable codes; synchronous codes; Binary codes; Councils; Decoding; Delay; H infinity control; Information theory; Probability distribution; Random variables; Redundancy;
Journal_Title :
Information Theory, IEEE Transactions on
