{"title":"在二进制对称信道串接中中继一个比特","authors":"Wasim Huleihel, Yury Polyanskiy, O. Shayevitz","doi":"10.1109/ISIT.2019.8849298","DOIUrl":null,"url":null,"abstract":"We consider the problem of transmitting reliably one bit of information across a tandem of binary symmetric channels interconnected by a relay/processor station. In our setting, the relay is instantaneous in the sense that its outputs are allowed to causally depend on previous received noisy bits. For this model, we investigate the optimal exponential decay rate of the average probability of error, when relaying one bit of information using n synchronous channel uses, by devising good relaying schemes.","PeriodicalId":6708,"journal":{"name":"2019 IEEE International Symposium on Information Theory (ISIT)","volume":"20 1","pages":"2928-2932"},"PeriodicalIF":0.0000,"publicationDate":"2019-07-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"12","resultStr":"{\"title\":\"Relaying One Bit Across a Tandem of Binary-Symmetric Channels\",\"authors\":\"Wasim Huleihel, Yury Polyanskiy, O. Shayevitz\",\"doi\":\"10.1109/ISIT.2019.8849298\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We consider the problem of transmitting reliably one bit of information across a tandem of binary symmetric channels interconnected by a relay/processor station. In our setting, the relay is instantaneous in the sense that its outputs are allowed to causally depend on previous received noisy bits. For this model, we investigate the optimal exponential decay rate of the average probability of error, when relaying one bit of information using n synchronous channel uses, by devising good relaying schemes.\",\"PeriodicalId\":6708,\"journal\":{\"name\":\"2019 IEEE International Symposium on Information Theory (ISIT)\",\"volume\":\"20 1\",\"pages\":\"2928-2932\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2019-07-07\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"12\",\"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.8849298\",\"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.8849298","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Relaying One Bit Across a Tandem of Binary-Symmetric Channels
We consider the problem of transmitting reliably one bit of information across a tandem of binary symmetric channels interconnected by a relay/processor station. In our setting, the relay is instantaneous in the sense that its outputs are allowed to causally depend on previous received noisy bits. For this model, we investigate the optimal exponential decay rate of the average probability of error, when relaying one bit of information using n synchronous channel uses, by devising good relaying schemes.