We consider the problem of constructing statistically synchronizable codes over arbitrary alphabets and for any finite source. We show how to efficiently construct a statistically synchronizable code whose average codeword length is whithin the least likely codeword probability from that of the Huffman code for the same source. Moreover, we give a method for constructing codes having a synchronizing codeword. The codes we construct present high synchronizing capability and low redundancy.
On the Construction of Statistically Synchronizable Codes
DE SANTIS, Alfredo;GARGANO, Luisa;VACCARO, Ugo
1992-01-01
Abstract
We consider the problem of constructing statistically synchronizable codes over arbitrary alphabets and for any finite source. We show how to efficiently construct a statistically synchronizable code whose average codeword length is whithin the least likely codeword probability from that of the Huffman code for the same source. Moreover, we give a method for constructing codes having a synchronizing codeword. The codes we construct present high synchronizing capability and low redundancy.File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
