{"title":"基于C-K方程的齐次马尔可夫源信息熵证明","authors":"Dexin Li","doi":"10.1109/ICASID.2010.5551511","DOIUrl":null,"url":null,"abstract":"This article proposes a methodology on how to justify homogeneous Markov source information entropy based on Chapman-Kolmogorov equation. According to the ergodic theorem, a new proof methodology is proposed in this article, which is different from the basis on properties of information entropy.","PeriodicalId":391931,"journal":{"name":"2010 International Conference on Anti-Counterfeiting, Security and Identification","volume":"3 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-07-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Homogeneous Markov source information entropy proof based on C-K equation\",\"authors\":\"Dexin Li\",\"doi\":\"10.1109/ICASID.2010.5551511\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This article proposes a methodology on how to justify homogeneous Markov source information entropy based on Chapman-Kolmogorov equation. According to the ergodic theorem, a new proof methodology is proposed in this article, which is different from the basis on properties of information entropy.\",\"PeriodicalId\":391931,\"journal\":{\"name\":\"2010 International Conference on Anti-Counterfeiting, Security and Identification\",\"volume\":\"3 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2010-07-18\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2010 International Conference on Anti-Counterfeiting, Security and Identification\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICASID.2010.5551511\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 International Conference on Anti-Counterfeiting, Security and Identification","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICASID.2010.5551511","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Homogeneous Markov source information entropy proof based on C-K equation
This article proposes a methodology on how to justify homogeneous Markov source information entropy based on Chapman-Kolmogorov equation. According to the ergodic theorem, a new proof methodology is proposed in this article, which is different from the basis on properties of information entropy.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
