{"title":"关于成对碰撞排列的大小","authors":"J. Körner, Chandra Nair, David Ng","doi":"10.1109/ISIT.2019.8849602","DOIUrl":null,"url":null,"abstract":"A structured code that improves the previously best known exponential asymptotic lower bound for the maximum cardinality of a pairwise-colliding set of permutations is presented. The main contribution is an explicit construction of an infinite recursion of pairwise-colliding sets of partial-permutations.","PeriodicalId":6708,"journal":{"name":"2019 IEEE International Symposium on Information Theory (ISIT)","volume":"18 1","pages":"2354-2358"},"PeriodicalIF":0.0000,"publicationDate":"2019-07-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"On the size of pairwise-colliding permutations\",\"authors\":\"J. Körner, Chandra Nair, David Ng\",\"doi\":\"10.1109/ISIT.2019.8849602\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A structured code that improves the previously best known exponential asymptotic lower bound for the maximum cardinality of a pairwise-colliding set of permutations is presented. The main contribution is an explicit construction of an infinite recursion of pairwise-colliding sets of partial-permutations.\",\"PeriodicalId\":6708,\"journal\":{\"name\":\"2019 IEEE International Symposium on Information Theory (ISIT)\",\"volume\":\"18 1\",\"pages\":\"2354-2358\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2019-07-07\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2019 IEEE International Symposium on Information Theory (ISIT)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISIT.2019.8849602\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 IEEE International Symposium on Information Theory (ISIT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISIT.2019.8849602","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A structured code that improves the previously best known exponential asymptotic lower bound for the maximum cardinality of a pairwise-colliding set of permutations is presented. The main contribution is an explicit construction of an infinite recursion of pairwise-colliding sets of partial-permutations.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
