{"title":"带Markovity的一助二二次高斯源编码问题的速率域","authors":"O. Bilgen, A. Wagner","doi":"10.1109/CISS53076.2022.9751169","DOIUrl":null,"url":null,"abstract":"We study the quadratic Gaussian one-help-two source-coding problem with Markovity, in which three encoders separately encode the components of a memoryless vector-Gaussian source that form a Markov chain and the central decoder aims to reproduce the first and the second components in the chain subject to individual mean-squared distortion constraints. We determine the rate region under a high-resolution assumption for the middle source.","PeriodicalId":305918,"journal":{"name":"2022 56th Annual Conference on Information Sciences and Systems (CISS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-03-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Rate Region of the One-Help-Two Quadratic Gaussian Source-Coding Problem with Markovity\",\"authors\":\"O. Bilgen, A. Wagner\",\"doi\":\"10.1109/CISS53076.2022.9751169\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We study the quadratic Gaussian one-help-two source-coding problem with Markovity, in which three encoders separately encode the components of a memoryless vector-Gaussian source that form a Markov chain and the central decoder aims to reproduce the first and the second components in the chain subject to individual mean-squared distortion constraints. We determine the rate region under a high-resolution assumption for the middle source.\",\"PeriodicalId\":305918,\"journal\":{\"name\":\"2022 56th Annual Conference on Information Sciences and Systems (CISS)\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2022-03-09\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2022 56th Annual Conference on Information Sciences and Systems (CISS)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CISS53076.2022.9751169\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2022 56th Annual Conference on Information Sciences and Systems (CISS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CISS53076.2022.9751169","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Rate Region of the One-Help-Two Quadratic Gaussian Source-Coding Problem with Markovity
We study the quadratic Gaussian one-help-two source-coding problem with Markovity, in which three encoders separately encode the components of a memoryless vector-Gaussian source that form a Markov chain and the central decoder aims to reproduce the first and the second components in the chain subject to individual mean-squared distortion constraints. We determine the rate region under a high-resolution assumption for the middle source.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
