{"title":"平稳非遍历源的变速率源编码定理","authors":"M. Effros, P. Chou, R. Gray","doi":"10.1109/ISIT.1994.395006","DOIUrl":null,"url":null,"abstract":"The source coding theorem and its converse imply that the optimal performance theoretically achievable by a fixed- or variable-rate block quantizer on a stationary ergodic source equals the distortion-rate function. While a fixed-rate block code cannot achieve arbitrarily closely the distortion-rate function on an arbitrary stationary nonergodic source, the authors show for the case of Polish alphabets that a variable-rate block code can. They also show that the distortion-rate function of a stationary nonergodic source has a decomposition as the average over points of equal slope on the distortion-rate functions of the source's stationary ergodic components. These results extend earlier finite alphabet results.<<ETX>>","PeriodicalId":331390,"journal":{"name":"Proceedings of 1994 IEEE International Symposium on Information Theory","volume":"25 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1994-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"22","resultStr":"{\"title\":\"Variable-rate source coding theorems for stationary nonergodic sources\",\"authors\":\"M. Effros, P. Chou, R. Gray\",\"doi\":\"10.1109/ISIT.1994.395006\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The source coding theorem and its converse imply that the optimal performance theoretically achievable by a fixed- or variable-rate block quantizer on a stationary ergodic source equals the distortion-rate function. While a fixed-rate block code cannot achieve arbitrarily closely the distortion-rate function on an arbitrary stationary nonergodic source, the authors show for the case of Polish alphabets that a variable-rate block code can. They also show that the distortion-rate function of a stationary nonergodic source has a decomposition as the average over points of equal slope on the distortion-rate functions of the source's stationary ergodic components. These results extend earlier finite alphabet results.<<ETX>>\",\"PeriodicalId\":331390,\"journal\":{\"name\":\"Proceedings of 1994 IEEE International Symposium on Information Theory\",\"volume\":\"25 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1994-11-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"22\",\"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.395006\",\"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.395006","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Variable-rate source coding theorems for stationary nonergodic sources
The source coding theorem and its converse imply that the optimal performance theoretically achievable by a fixed- or variable-rate block quantizer on a stationary ergodic source equals the distortion-rate function. While a fixed-rate block code cannot achieve arbitrarily closely the distortion-rate function on an arbitrary stationary nonergodic source, the authors show for the case of Polish alphabets that a variable-rate block code can. They also show that the distortion-rate function of a stationary nonergodic source has a decomposition as the average over points of equal slope on the distortion-rate functions of the source's stationary ergodic components. These results extend earlier finite alphabet results.<>