Markov capacity for factor codes with an unambiguous symbol

IF 0.8 3区 数学 Q2 MATHEMATICS
GUANGYUE HAN, BRIAN MARCUS, CHENGYU WU
{"title":"Markov capacity for factor codes with an unambiguous symbol","authors":"GUANGYUE HAN, BRIAN MARCUS, CHENGYU WU","doi":"10.1017/etds.2023.103","DOIUrl":null,"url":null,"abstract":"Abstract In this paper, we first give a necessary and sufficient condition for a factor code with an unambiguous symbol to admit a subshift of finite type restricted to which it is one-to-one and onto. We then give a necessary and sufficient condition for the standard factor code on a spoke graph to admit a subshift of finite type restricted to which it is finite-to-one and onto. We also conjecture that for such a code, the finite-to-one and onto property is equivalent to the existence of a stationary Markov chain that achieves the capacity of the corresponding deterministic channel.","PeriodicalId":50504,"journal":{"name":"Ergodic Theory and Dynamical Systems","volume":null,"pages":null},"PeriodicalIF":0.8000,"publicationDate":"2023-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Ergodic Theory and Dynamical Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1017/etds.2023.103","RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"MATHEMATICS","Score":null,"Total":0}
引用次数: 0

Abstract

Abstract In this paper, we first give a necessary and sufficient condition for a factor code with an unambiguous symbol to admit a subshift of finite type restricted to which it is one-to-one and onto. We then give a necessary and sufficient condition for the standard factor code on a spoke graph to admit a subshift of finite type restricted to which it is finite-to-one and onto. We also conjecture that for such a code, the finite-to-one and onto property is equivalent to the existence of a stationary Markov chain that achieves the capacity of the corresponding deterministic channel.
具有明确符号的因子码的马尔可夫容量
摘要本文首先给出了具有明确符号的因子码允许有限类型子位移的一个充要条件,该子位移是一对一和映上的。然后给出了辐图上标准因子码允许有限型子位移的充分必要条件,该子位移是有限到1且有限到上的。我们还推测,对于这样一个码,有限到一和上的性质等价于一个达到相应确定性信道容量的平稳马尔可夫链的存在。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
CiteScore
1.70
自引率
11.10%
发文量
113
审稿时长
6-12 weeks
期刊介绍: Ergodic Theory and Dynamical Systems focuses on a rich variety of research areas which, although diverse, employ as common themes global dynamical methods. The journal provides a focus for this important and flourishing area of mathematics and brings together many major contributions in the field. The journal acts as a forum for central problems of dynamical systems and of interactions of dynamical systems with areas such as differential geometry, number theory, operator algebras, celestial and statistical mechanics, and biology.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信