Variable-Length Prefix Codes With Multiple Delimiters

Anatoly V. Anisimov; Igor O. Zavadskyi

首页> 外文期刊>Information Theory, IEEE Transactions on >Variable-Length Prefix Codes With Multiple Delimiters

【24h】

Variable-Length Prefix Codes With Multiple Delimiters

机译：具有多个定界符的可变长度前缀代码

获取原文

获取原文并翻译 | 示例

掌桥外文数据库（机构版） >>

开具论文收录证明 >>

文献代查 >>

页面导航

摘要
著录项
相似文献
相关主题

摘要

Let m1, m2, . . . , mt be a fixed set of natural integers given in ascending order. A multi-delimiter code Dm1,...,mt consists of t words of the form 1mi0 and all other binary words with suffixes having one of the forms 01mi 0 that cannot occur in other places of a word, i = 1, . . . , t. Completeness, universality, and density characteristics of multi-delimiter codes are proved. Encoding of integers by multi-delimiter codes is considered in detail. For these codes, fast byte aligned decoding algorithms are also discussed. The comparison of compression rate and decoding speed of Fibonacci codes, (s, c)-dense codes and different multi-delimiter codes is presented. By many useful properties, multi-delimiter codes are superior to Fibonacci codes.

机译：设m1，m2，。。。，mt是一组固定的自然整数，它们以升序给出。多定界符代码Dm1，...，mt由形式为1mi0的t个单词和带有后缀的所有其他二进制单词组成，形式后缀为01mi 0之一，不能出现在单词的其他位置，i = 1，...。。。，t。证明了多定界符代码的完整性，通用性和密度特征。详细考虑了通过多定界符代码对整数进行编码。对于这些代码，还讨论了快速字节对齐的解码算法。给出了斐波那契码，（s，c）密集码和不同的多定界码的压缩率和解码速度的比较。通过许多有用的属性，多定界符代码优于斐波那契代码。

著录项

来源
《Information Theory, IEEE Transactions on》 |2017年第5期|2885-2895|共11页
作者
Anatoly V. Anisimov; Igor O. Zavadskyi;
展开▼
作者单位

Department of Mathematical Informatics, Taras Shevchenko National University of Kyiv, Kyiv, Ukraine;

Department of Mathematical Informatics, Taras Shevchenko National University of Kyiv, Kyiv, Ukraine;

展开▼
收录信息
原文格式 PDF
正文语种 eng
中图分类
关键词
Encoding; Decoding; Robustness; Data compression; Informatics; Synchronization; Probability distribution;

机译：编码;解码;稳健性;数据压缩;信息学;同步;概率分布;

相似文献

外文文献
中文文献
专利

1. Generalised prefix for space-time block-coded orthogonal frequency division multiplexing wireless systems over correlated multiple-input multipleoutput channels [J] . Y??ld??z H., Acar Y., Cooklev T., Communications, IET . 2014,第9期

机译：相关多输入多输出信道上的空时分组编码正交频分复用无线系统的通用前缀
2. CFO/Channel estimation algorithms for space-time block coded orthogonal frequency division multiplexing wireless relay networks without using cyclic prefix of OFDM [J] . Lin Tsui-Tsai, Hwang Fuh-Hsin Signal Processing, IET . 2019,第7期

机译：不使用OFDM循环前缀的空时分组编码正交频分复用无线中继网络的CFO /信道估计算法
3. CFO/Channel estimation algorithms for space-time block coded orthogonal frequency division multiplexing wireless relay networks without using cyclic prefix of OFDM [J] . Lin Tsui-Tsai, Hwang Fuh-Hsin Signal Processing, IET . 2019,第7期

机译：CFO /信道估计算法用于时空块编码正交频分复用无线继承网络而不使用OFDM的循环前缀
4. Underwater Communication Using Full-Body Gestures and Optimal Variable-Length Prefix Codes [C] . Karim Koreitem, Jimmy Li, Ian Karp, International Conference on Robotics and Automation . 2019

机译：使用全身手势和最佳可变长度前缀代码进行水下通信
5. Variable-Length Coding Incremental Redundancy Hybrid Automatic Repeat reQuest (HARQ) over Fading Channels [D] . Khosravirad, Saeed R. 2015

机译：可变长度编码增量冗余混合混合型混合型自动重复请求（HARQ）在衰落通道上
6. High capacity DNA data storage with variable-length Oligonucleotides using repeat accumulate code and hybrid mapping [O] . Yixin Wang, Md Noor-A-Rahim, Jingyun Zhang, 2019

机译：使用重复累积码和杂交作图使用可变长度的寡核苷酸进行大容量DNA数据存储
7. Iterative Construction of Reversible Variable-Length Codes and Variable-Length Error-Correcting Codes [O] . Wang J., Yang L-L., Hanzo L. 2004

机译：可逆变长码和可变长度纠错码的迭代构造

Variable-Length Prefix Codes With Multiple Delimiters

摘要

著录项

相似文献

相关主题

期刊订阅