{"title":"平稳、渐近无记忆、连续信道的编码定理","authors":"T. Kadota, A. Wyner","doi":"10.1214/AOMS/1177692392","DOIUrl":null,"url":null,"abstract":"We give a mathematical definition of stationary, asymptotically memoryless, continuous-time channels, and prove a coding theorem and its converse for such channels.","PeriodicalId":50764,"journal":{"name":"Annals of Mathematical Statistics","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"1972-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"27","resultStr":"{\"title\":\"Coding Theorem for Stationary, Asymptotically Memoryless, Continuous-time Channels\",\"authors\":\"T. Kadota, A. Wyner\",\"doi\":\"10.1214/AOMS/1177692392\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We give a mathematical definition of stationary, asymptotically memoryless, continuous-time channels, and prove a coding theorem and its converse for such channels.\",\"PeriodicalId\":50764,\"journal\":{\"name\":\"Annals of Mathematical Statistics\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1972-10-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"27\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Annals of Mathematical Statistics\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1214/AOMS/1177692392\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Annals of Mathematical Statistics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1214/AOMS/1177692392","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Coding Theorem for Stationary, Asymptotically Memoryless, Continuous-time Channels
We give a mathematical definition of stationary, asymptotically memoryless, continuous-time channels, and prove a coding theorem and its converse for such channels.