{"title":"辅助医疗队经常性单面频道","authors":"François Simon","doi":"10.1109/ITW.2012.6404750","DOIUrl":null,"url":null,"abstract":"This paper is devoted to a first analysis of the class of recurrent AMS formal communication channels. The purpose is to generalize some results and approaches dealing with two-sided channels to a wider class of AMS channels assuming non-invertible shifts and thus to cover, to a certain extent, one-sided channels. The basis is to consider recurrent random processes for which the stationary mean dominates (and not only asymptotically dominates) the AMS probability distribution. Some results established for two-sided channels can be partly extended to recurrent AMS one-sided channels.","PeriodicalId":325771,"journal":{"name":"2012 IEEE Information Theory Workshop","volume":"39 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Recurrent AMS one-sided channels\",\"authors\":\"François Simon\",\"doi\":\"10.1109/ITW.2012.6404750\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper is devoted to a first analysis of the class of recurrent AMS formal communication channels. The purpose is to generalize some results and approaches dealing with two-sided channels to a wider class of AMS channels assuming non-invertible shifts and thus to cover, to a certain extent, one-sided channels. The basis is to consider recurrent random processes for which the stationary mean dominates (and not only asymptotically dominates) the AMS probability distribution. Some results established for two-sided channels can be partly extended to recurrent AMS one-sided channels.\",\"PeriodicalId\":325771,\"journal\":{\"name\":\"2012 IEEE Information Theory Workshop\",\"volume\":\"39 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2012-09-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2012 IEEE Information Theory Workshop\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ITW.2012.6404750\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2012 IEEE Information Theory Workshop","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ITW.2012.6404750","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
This paper is devoted to a first analysis of the class of recurrent AMS formal communication channels. The purpose is to generalize some results and approaches dealing with two-sided channels to a wider class of AMS channels assuming non-invertible shifts and thus to cover, to a certain extent, one-sided channels. The basis is to consider recurrent random processes for which the stationary mean dominates (and not only asymptotically dominates) the AMS probability distribution. Some results established for two-sided channels can be partly extended to recurrent AMS one-sided channels.