{"title":"广义Kendall tau和Cayley度量中的断点分析和排列码","authors":"Y. M. Chee, Van Khu Vu","doi":"10.1109/ISIT.2014.6875376","DOIUrl":null,"url":null,"abstract":"Permutation codes under the Cayley, Kendall tau, and Ulam metrics have been studied recently due to applications in flash memories. We consider permutation codes under more general metrics. We use breakpoints in permutations to gain additional insights to distances in codes. As a result, we construct codes under these general metrics that are larger than those previously known under more restricted metrics.","PeriodicalId":127191,"journal":{"name":"2014 IEEE International Symposium on Information Theory","volume":"221 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-08-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"12","resultStr":"{\"title\":\"Breakpoint analysis and permutation codes in generalized Kendall tau and Cayley metrics\",\"authors\":\"Y. M. Chee, Van Khu Vu\",\"doi\":\"10.1109/ISIT.2014.6875376\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Permutation codes under the Cayley, Kendall tau, and Ulam metrics have been studied recently due to applications in flash memories. We consider permutation codes under more general metrics. We use breakpoints in permutations to gain additional insights to distances in codes. As a result, we construct codes under these general metrics that are larger than those previously known under more restricted metrics.\",\"PeriodicalId\":127191,\"journal\":{\"name\":\"2014 IEEE International Symposium on Information Theory\",\"volume\":\"221 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2014-08-11\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"12\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2014 IEEE International Symposium on Information Theory\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISIT.2014.6875376\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2014 IEEE International Symposium on Information Theory","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISIT.2014.6875376","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Breakpoint analysis and permutation codes in generalized Kendall tau and Cayley metrics
Permutation codes under the Cayley, Kendall tau, and Ulam metrics have been studied recently due to applications in flash memories. We consider permutation codes under more general metrics. We use breakpoints in permutations to gain additional insights to distances in codes. As a result, we construct codes under these general metrics that are larger than those previously known under more restricted metrics.