The Structure of Optimal Prefix-Free Codes in Restricted Languages: The Uniform Probability Case

机译：受限语言中的最佳无前缀代码结构：统一概率案例

获取原文

获取原文并翻译 | 示例

页面导航

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

摘要

In this paper we discuss the problem of constructing minimum-cost, prefix-free codes for equiprobable words under the assumption that all codewords are restricted to belonging to an arbitrary language L and extend the classes of languages to which L can belong.

机译：在本文中，我们讨论了在所有代码字都限于属于任意语言L并扩展了L可以属于的语言类别的假设下，为等概率单词构造成本最低的无前缀代码的问题。

著录项

来源
《International Workshop on Algorithms and Data Structures(WADS 2005); 20050815-17; Waterloo(CA)》|2005年|P.372-384|共13页
会议地点 Waterloo(CA)
作者
Mordecai J. Golin; Zhenming Liu;
展开▼
作者单位

Department of Computer Science, HKUST, Clear Water Bay, Kowloon, Hong Kong;

展开▼
会议组织
原文格式 PDF
正文语种 eng
中图分类 TP311.13;
关键词

相似文献

外文文献
中文文献
专利

1. Faster Algorithm for Designing Optimal Prefix-Free Codes with Unequal Letter Costs [J] . Sorina Dumitrescu Fundamenta Informaticae . 2006,第1a2期

机译：不等字母成本的设计最优无前缀码的更快算法
2. A dynamic programming algorithm for constructing optimal "1"-ended binary prefix-free codes [J] . Sze-Lok Chan, Golin M.J. IEEE Transactions on Information Theory . 2000,第4期

机译：一种构造最优“ 1”端二进制无前缀码的动态编程算法
3. A dynamic programming algorithm for constructing optimal prefix-free codes with unequal letter costs [J] . Golin M.J., Rote G. IEEE Transactions on Information Theory . 1998,第5期

机译：一种动态算法，用于构造不等字母代价的最优无前缀码
4. The Structure of Optimal Prefix-Free Codes in Restricted Languages: The Uniform Probability Case [C] . Mordecai J. Golin, Zhenming Liu International Workshop on Algorithms and Data Structures . 2005

机译：限制语言中最佳前缀代码的结构：均匀概率案例
5. Metrical foot structure in Thai and Kayah Li: Optimality-theoretic studies in the prosody of two southeast Asian languages [D] . Bennett, Jefferson Fraser 1995

机译：泰语和Kayah Li的度量脚结构：两种东南亚语言韵律中的最优性理论研究
6. The suboptimal structures find the optimal RNAs: homology search for bacterial non-coding RNAs using suboptimal RNA structures [O] . Josef Pánek, Libor Krásný, Jan Bobek, 2011

机译：次优结构可找到最佳RNA：利用次优RNA结构同源搜索细菌非编码RNA
7. The Structure of Optimal Prefix-Free Codes in Restricted Languages: The Uniform Probability Case [O] . Mordecai J. Golin, Zhenming Liu 2008

机译：限制语言中最优前缀自由码的结构：统一概率案例

The Structure of Optimal Prefix-Free Codes in Restricted Languages: The Uniform Probability Case

摘要

著录项

引文网络

相似文献

相关主题

期刊订阅