Markov Capacity for Factor Codes with an Unambiguous Symbol
From MaRDI portal
Publication:6414727
arXiv2210.12251MaRDI QIDQ6414727FDOQ6414727
Authors: Guangyue Han, Brian Marcus, Chengyu Wu 
Publication date: 21 October 2022
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.
This page was built for publication: Markov Capacity for Factor Codes with an Unambiguous Symbol
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6414727)
