{"title":"编码对抗短视的对手","authors":"A. Sarwate","doi":"10.1109/CIG.2010.5592896","DOIUrl":null,"url":null,"abstract":"A variant on the arbitrarily varying channel (AVC) is proposed in which the jammer is allowed to base its actions on a noisy version of the transmitted codeword. It is shown via a random coding argument that the capacity is the minimum over all discrete memoryless channels (DMCs) that can be induced by memoryless strategies of the adversary. This generalizes two existing models in the AVC literature: the standard AVC in which the jammer does not know the channel input, and the AVC in which the jammer knows the channel input exactly.","PeriodicalId":354925,"journal":{"name":"2010 IEEE Information Theory Workshop","volume":"88 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-09-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"28","resultStr":"{\"title\":\"Coding against myopic adversaries\",\"authors\":\"A. Sarwate\",\"doi\":\"10.1109/CIG.2010.5592896\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A variant on the arbitrarily varying channel (AVC) is proposed in which the jammer is allowed to base its actions on a noisy version of the transmitted codeword. It is shown via a random coding argument that the capacity is the minimum over all discrete memoryless channels (DMCs) that can be induced by memoryless strategies of the adversary. This generalizes two existing models in the AVC literature: the standard AVC in which the jammer does not know the channel input, and the AVC in which the jammer knows the channel input exactly.\",\"PeriodicalId\":354925,\"journal\":{\"name\":\"2010 IEEE Information Theory Workshop\",\"volume\":\"88 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2010-09-30\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"28\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2010 IEEE Information Theory Workshop\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CIG.2010.5592896\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 IEEE Information Theory Workshop","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CIG.2010.5592896","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A variant on the arbitrarily varying channel (AVC) is proposed in which the jammer is allowed to base its actions on a noisy version of the transmitted codeword. It is shown via a random coding argument that the capacity is the minimum over all discrete memoryless channels (DMCs) that can be induced by memoryless strategies of the adversary. This generalizes two existing models in the AVC literature: the standard AVC in which the jammer does not know the channel input, and the AVC in which the jammer knows the channel input exactly.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
