{"title":"在二进制或信道上使用的抗干扰码的擦除概率的下界","authors":"G. Hedby","doi":"10.1109/ISIT.1994.395094","DOIUrl":null,"url":null,"abstract":"An anti-jamming code consists of a set of codes obtained from the coset partitioning of a larger code. The code is used over a binary OR-channel subject to intentional interference. We derive a lower bound on the probability of erasing a codeword.<<ETX>>","PeriodicalId":331390,"journal":{"name":"Proceedings of 1994 IEEE International Symposium on Information Theory","volume":"10 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1994-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A lower bound on the probability of erasure for an anti-jamming code when used on the binary OR-channel\",\"authors\":\"G. Hedby\",\"doi\":\"10.1109/ISIT.1994.395094\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"An anti-jamming code consists of a set of codes obtained from the coset partitioning of a larger code. The code is used over a binary OR-channel subject to intentional interference. We derive a lower bound on the probability of erasing a codeword.<<ETX>>\",\"PeriodicalId\":331390,\"journal\":{\"name\":\"Proceedings of 1994 IEEE International Symposium on Information Theory\",\"volume\":\"10 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1994-06-27\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"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.395094\",\"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.395094","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A lower bound on the probability of erasure for an anti-jamming code when used on the binary OR-channel
An anti-jamming code consists of a set of codes obtained from the coset partitioning of a larger code. The code is used over a binary OR-channel subject to intentional interference. We derive a lower bound on the probability of erasing a codeword.<>
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
