arXiv · 2210.12251
Markov Capacity for Factor Codes with an Unambiguous Symbol
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, this finite-to-one property is equivalent to the existence of a stationary Markov chain that achieves the capacity of the corresponding deterministic channel.
Explore related subjects
Keep this discovery
Guangyue Han, Brian Marcus, Chengyu Wu. 2022-10-21. Markov Capacity for Factor Codes with an Unambiguous Symbol. https://doi.org/10.1017/etds.2023.103
Cite the original work for its findings. Save a collection to share your selection of sources.