论置换映射的距离最优性

Proceedings. International Symposium on Information Theory, 2005. ISIT 2005. Pub Date : 2005-10-31 DOI:10.1109/ISIT.2005.1523503

T. Swart, Ian de Beer, H. C. Ferreira

{"title":"论置换映射的距离最优性","authors":"T. Swart, Ian de Beer, H. C. Ferreira","doi":"10.1109/ISIT.2005.1523503","DOIUrl":null,"url":null,"abstract":"We investigate the optimal Hamming distance that is achievable when mapping binary sequences to permutation sequences. This is used to determine how close to optimum some of the known mappings are. Furthermore, using simulation results we show that mappings found by exhaustive search using optimum distance as criterion perform better than previous known mappings","PeriodicalId":166130,"journal":{"name":"Proceedings. International Symposium on Information Theory, 2005. ISIT 2005.","volume":"32 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2005-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"15","resultStr":"{\"title\":\"On the distance optimality of permutation mappings\",\"authors\":\"T. Swart, Ian de Beer, H. C. Ferreira\",\"doi\":\"10.1109/ISIT.2005.1523503\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We investigate the optimal Hamming distance that is achievable when mapping binary sequences to permutation sequences. This is used to determine how close to optimum some of the known mappings are. Furthermore, using simulation results we show that mappings found by exhaustive search using optimum distance as criterion perform better than previous known mappings\",\"PeriodicalId\":166130,\"journal\":{\"name\":\"Proceedings. International Symposium on Information Theory, 2005. ISIT 2005.\",\"volume\":\"32 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2005-10-31\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"15\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings. International Symposium on Information Theory, 2005. ISIT 2005.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISIT.2005.1523503\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings. International Symposium on Information Theory, 2005. ISIT 2005.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISIT.2005.1523503","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 15

摘要

我们研究了二值序列映射到置换序列时所能达到的最优汉明距离。这用于确定一些已知映射离最优值有多近。此外，仿真结果表明，以最优距离为准则的穷举搜索得到的映射比以前已知的映射性能更好

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

查看原文本刊更多论文

On the distance optimality of permutation mappings

We investigate the optimal Hamming distance that is achievable when mapping binary sequences to permutation sequences. This is used to determine how close to optimum some of the known mappings are. Furthermore, using simulation results we show that mappings found by exhaustive search using optimum distance as criterion perform better than previous known mappings

求助全文

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

来源期刊

Proceedings. International Symposium on Information Theory, 2005. ISIT 2005.

自引率

0.00%

发文量