An arithmetic coding algorithm that incorporates channel coding is presented. For a source alphabet with m symbols, the selected m code points over the [0-1) interval have a desired minimum Hamming distance d/sub min/ between them. The decoder utilises this d/sub min/ in conjunction with the self-synchronisation property of arithmetic coding and knowledge of the source statistics to recover the original sequence of symbols, in the presence of channel errors, without the use of known channel coding techniques. The selected d/sub min/ provides a desired error protection level. The introduced scheme is suitable for bandwidth-limited binary symmetric channels (BSCs) with moderate to high error rates.
展开▼
机译：提出了一种结合了信道编码的算术编码算法。对于具有m个符号的源字母表，在[0-1]间隔内选定的m个代码点之间具有所需的最小汉明距离d / sub min /。解码器在存在信道错误的情况下，结合算术编码的自同步特性和源统计信息，利用此d / sub min /来恢复符号的原始序列，而无需使用已知的信道编码技术。所选的d / sub min /提供所需的错误保护级别。引入的方案适用于具有中等到高错误率的带宽受限的二进制对称信道（BSC）。
展开▼
