{"title":"用于多用户通信的特定排列码的构造","authors":"V. Balakirsky, A. Vinck","doi":"10.1109/ITW.2001.955142","DOIUrl":null,"url":null,"abstract":"Regular constructions for specific permutation codes used in a multiple-access OR channel where the inputs originate from a fast frequency hopping/multiple frequency shift keying modulation are presented for 3 situations : (1) each sender is either active or passive; (2) the jammer is allowed to corrupt a certain number of transmitted frequencies; and (3) the sender transmit one of a certain number of messages. We show that these constructions are optimum ones for the situations (1), (2) and that they are close to the optimum for the situation (3).","PeriodicalId":288814,"journal":{"name":"Proceedings 2001 IEEE Information Theory Workshop (Cat. No.01EX494)","volume":"57 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2001-09-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Constructions of specific permutation codes for multi-user communication\",\"authors\":\"V. Balakirsky, A. Vinck\",\"doi\":\"10.1109/ITW.2001.955142\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Regular constructions for specific permutation codes used in a multiple-access OR channel where the inputs originate from a fast frequency hopping/multiple frequency shift keying modulation are presented for 3 situations : (1) each sender is either active or passive; (2) the jammer is allowed to corrupt a certain number of transmitted frequencies; and (3) the sender transmit one of a certain number of messages. We show that these constructions are optimum ones for the situations (1), (2) and that they are close to the optimum for the situation (3).\",\"PeriodicalId\":288814,\"journal\":{\"name\":\"Proceedings 2001 IEEE Information Theory Workshop (Cat. No.01EX494)\",\"volume\":\"57 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2001-09-02\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings 2001 IEEE Information Theory Workshop (Cat. No.01EX494)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ITW.2001.955142\",\"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 2001 IEEE Information Theory Workshop (Cat. No.01EX494)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ITW.2001.955142","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Constructions of specific permutation codes for multi-user communication
Regular constructions for specific permutation codes used in a multiple-access OR channel where the inputs originate from a fast frequency hopping/multiple frequency shift keying modulation are presented for 3 situations : (1) each sender is either active or passive; (2) the jammer is allowed to corrupt a certain number of transmitted frequencies; and (3) the sender transmit one of a certain number of messages. We show that these constructions are optimum ones for the situations (1), (2) and that they are close to the optimum for the situation (3).