翻译方案和LP边界

2013 13th Canadian Workshop on Information Theory Pub Date : 2013-06-18 DOI:10.1109/CWIT.2013.6621620

A. Al-Bashabsheh, Yongyi Mao, T. Chan

{"title":"翻译方案和LP边界","authors":"A. Al-Bashabsheh, Yongyi Mao, T. Chan","doi":"10.1109/CWIT.2013.6621620","DOIUrl":null,"url":null,"abstract":"We summarize some results and concepts regarding translation schemes in hope of making such topic more accessible. Two subclasses of translation schemes are of particular interest, namely, the ordered and unordered extension schemes. A linear programming (LP) bound for translation schemes is discussed. Specifying the translation scheme as the ordered extension of the one-class translation scheme, such LP bound reduces to the recently derived LP bound of Chan et al. based on the notion of support enumerator.","PeriodicalId":398936,"journal":{"name":"2013 13th Canadian Workshop on Information Theory","volume":"8 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-06-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Translation schemes and LP bounds\",\"authors\":\"A. Al-Bashabsheh, Yongyi Mao, T. Chan\",\"doi\":\"10.1109/CWIT.2013.6621620\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We summarize some results and concepts regarding translation schemes in hope of making such topic more accessible. Two subclasses of translation schemes are of particular interest, namely, the ordered and unordered extension schemes. A linear programming (LP) bound for translation schemes is discussed. Specifying the translation scheme as the ordered extension of the one-class translation scheme, such LP bound reduces to the recently derived LP bound of Chan et al. based on the notion of support enumerator.\",\"PeriodicalId\":398936,\"journal\":{\"name\":\"2013 13th Canadian Workshop on Information Theory\",\"volume\":\"8 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2013-06-18\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2013 13th Canadian Workshop on Information Theory\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CWIT.2013.6621620\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 13th Canadian Workshop on Information Theory","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CWIT.2013.6621620","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 1

摘要

我们总结了一些关于翻译方案的研究成果和概念，希望能让人们更容易理解这一话题。翻译方案的两个子类是特别感兴趣的，即有序和无序扩展方案。讨论了平移方案的线性规划界。将翻译方案指定为单类翻译方案的有序扩展，这样的LP界根据支持枚举器的概念简化为Chan等人最近导出的LP界。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文

微信好友朋友圈 QQ好友复制链接

本刊更多论文

Translation schemes and LP bounds

We summarize some results and concepts regarding translation schemes in hope of making such topic more accessible. Two subclasses of translation schemes are of particular interest, namely, the ordered and unordered extension schemes. A linear programming (LP) bound for translation schemes is discussed. Specifying the translation scheme as the ordered extension of the one-class translation scheme, such LP bound reduces to the recently derived LP bound of Chan et al. based on the notion of support enumerator.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

2013 13th Canadian Workshop on Information Theory

自引率

0.00%

发文量