任意变化信道上有限块长有损联合信信道编码的极大极小定理

{"title":"任意变化信道上有限块长有损联合信信道编码的极大极小定理","authors":"Anuj S. Vora, Ankur A. Kulkarni","doi":"10.1134/S0032946021020010","DOIUrl":null,"url":null,"abstract":"","PeriodicalId":192112,"journal":{"name":"Probl. Inf. Transm.","volume":"92 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Minimax Theorems for Finite Blocklength Lossy Joint Source-Channel Coding over an Arbitrarily Varying Channel\",\"authors\":\"Anuj S. Vora, Ankur A. Kulkarni\",\"doi\":\"10.1134/S0032946021020010\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"\",\"PeriodicalId\":192112,\"journal\":{\"name\":\"Probl. Inf. Transm.\",\"volume\":\"92 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1900-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Probl. Inf. Transm.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1134/S0032946021020010\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Probl. Inf. Transm.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1134/S0032946021020010","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}