{"title":"重写S4和S5的成本最优秩调制码","authors":"Arijit Dutta, S. Vijayakumaran","doi":"10.1109/NCC.2018.8600115","DOIUrl":null,"url":null,"abstract":"In this paper, we have found all possible largest permutation codes in S4and S5under Kendall T-distance. We consider two rewrite operations namely push-to-the-top and minimal-push-up and give the optimum codes in terms of rewrite cost for both these techniques. These optimum codes can be obtained from a set of relatively smaller size for both the cases. We also give the largest single error correcting Gray code when minimal-push-up is used.","PeriodicalId":121544,"journal":{"name":"2018 Twenty Fourth National Conference on Communications (NCC)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Rewrite Cost optimal Rank Modulation Codes in S4 and S5\",\"authors\":\"Arijit Dutta, S. Vijayakumaran\",\"doi\":\"10.1109/NCC.2018.8600115\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we have found all possible largest permutation codes in S4and S5under Kendall T-distance. We consider two rewrite operations namely push-to-the-top and minimal-push-up and give the optimum codes in terms of rewrite cost for both these techniques. These optimum codes can be obtained from a set of relatively smaller size for both the cases. We also give the largest single error correcting Gray code when minimal-push-up is used.\",\"PeriodicalId\":121544,\"journal\":{\"name\":\"2018 Twenty Fourth National Conference on Communications (NCC)\",\"volume\":\"2 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-02-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2018 Twenty Fourth National Conference on Communications (NCC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/NCC.2018.8600115\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 Twenty Fourth National Conference on Communications (NCC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/NCC.2018.8600115","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
摘要
在Kendall t -距离下，我们找到了s4和s55中所有可能的最大排列码。我们考虑了两种重写操作，即push-to- top和minimum -push-up，并根据这两种技术的重写成本给出了最佳代码。对于这两种情况，都可以从一个相对较小的码集中得到这些最优码。当使用最小俯卧撑时，我们也给出了最大的单次纠错格雷码。
Rewrite Cost optimal Rank Modulation Codes in S4 and S5
In this paper, we have found all possible largest permutation codes in S4and S5under Kendall T-distance. We consider two rewrite operations namely push-to-the-top and minimal-push-up and give the optimum codes in terms of rewrite cost for both these techniques. These optimum codes can be obtained from a set of relatively smaller size for both the cases. We also give the largest single error correcting Gray code when minimal-push-up is used.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
