On the construction of statistically synchronizable codes

Capocelli, R.M.,De Santis, A.A.,Gargano, L.,Vaccaro, U.

IEEE Transactions on Information Theory - Part 2（1992）

引用 65|浏览0

暂无评分

摘要

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.<>

查看译文

关键词

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

AI 理解论文

溯源树

样例

生成溯源树，研究论文发展脉络

Chat Paper

正在生成论文摘要