.png){kind=icon}
返回
Binary arithmetic coding with key-based interval splitting
.png){kind=icon}
PRE
AI
DOI：10.1109/LSP.2005.861589.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Binary arithmetic coding involves recursive partitioning the range [0,1) in accordance with the relative probabilities of occurrence of the two input symbols. We describe a modification of this approach in which the overall length within the range [0,1) allocated to each symbol is preserved, but the traditional assumption that a single contiguous interval is used for each symbol is removed. A key known to both the encoder and decoder is used to describe where the intervals are split prior to encoding each new symbol. The repeated splitting has the effect of both scrambling the intervals and altering their lengths, thereby allowing both encryption and compression to be obtained simultaneously.
Keyword:
arithmetic codes
cryptography
data compression
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
9.6
论文数:
1.1W
被引数:
1.7W
机构
暂无机构信息
引用论文
Need for a consensus on the methods by which to measure joint mobility and the definition of norms for hypermobility that reflect age, gender and ethnic-dependent variation: is revision of criteria for joint hypermobility syndrome and Ehlers-Danlos syndrome hypermobility type indicated?.png)
Rheumatology
OAAI
RheumatologyIF0
OAAI分享收藏 没有更多内容
没有更多内容