{"title":"or通道抗干扰","authors":"C.C. Jonsson","doi":"10.1109/ISIT.1994.395095","DOIUrl":null,"url":null,"abstract":"We propose a frequency hopping scheme with M-ary frequency shift keying applied to the OR-channel and give its error and erasure probabilities. Asymptotically, the bit error probability is bounded away from zero whereas it polynomially tends to zero for our previously proposed generalized scheme.<<ETX>>","PeriodicalId":331390,"journal":{"name":"Proceedings of 1994 IEEE International Symposium on Information Theory","volume":"93 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1994-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"Anti-jamming on the OR-channel\",\"authors\":\"C.C. Jonsson\",\"doi\":\"10.1109/ISIT.1994.395095\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We propose a frequency hopping scheme with M-ary frequency shift keying applied to the OR-channel and give its error and erasure probabilities. Asymptotically, the bit error probability is bounded away from zero whereas it polynomially tends to zero for our previously proposed generalized scheme.<<ETX>>\",\"PeriodicalId\":331390,\"journal\":{\"name\":\"Proceedings of 1994 IEEE International Symposium on Information Theory\",\"volume\":\"93 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1994-06-27\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of 1994 IEEE International Symposium on Information Theory\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISIT.1994.395095\",\"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 of 1994 IEEE International Symposium on Information Theory","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISIT.1994.395095","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
We propose a frequency hopping scheme with M-ary frequency shift keying applied to the OR-channel and give its error and erasure probabilities. Asymptotically, the bit error probability is bounded away from zero whereas it polynomially tends to zero for our previously proposed generalized scheme.<>