File Download
There are no files associated with this item.
Links for fulltext
(May Require Subscription)
- Publisher Website: 10.1017/etds.2023.103
- Scopus: eid_2-s2.0-85176575799
- Find via
Supplementary
-
Citations:
- Scopus: 0
- Appears in Collections:
Article: Markov capacity for factor codes with an unambiguous symbol
Title | Markov capacity for factor codes with an unambiguous symbol |
---|---|
Authors | |
Keywords | factor codes finite-to-one codes Markov capacity shift of finite type symbolic dynamics |
Issue Date | 7-Nov-2023 |
Publisher | Cambridge University Press |
Citation | Ergodic Theory and Dynamical Systems, 2023, v. 44, n. 8, p. 2199-2228 How to Cite? |
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. |
Persistent Identifier | http://hdl.handle.net/10722/347736 |
ISSN | 2023 Impact Factor: 0.8 2023 SCImago Journal Rankings: 1.005 |
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Han, Guangyue | - |
dc.contributor.author | Marcus, Brian | - |
dc.contributor.author | Wu, Chengyu | - |
dc.date.accessioned | 2024-09-28T00:30:17Z | - |
dc.date.available | 2024-09-28T00:30:17Z | - |
dc.date.issued | 2023-11-07 | - |
dc.identifier.citation | Ergodic Theory and Dynamical Systems, 2023, v. 44, n. 8, p. 2199-2228 | - |
dc.identifier.issn | 0143-3857 | - |
dc.identifier.uri | http://hdl.handle.net/10722/347736 | - |
dc.description.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. | - |
dc.language | eng | - |
dc.publisher | Cambridge University Press | - |
dc.relation.ispartof | Ergodic Theory and Dynamical Systems | - |
dc.subject | factor codes | - |
dc.subject | finite-to-one codes | - |
dc.subject | Markov capacity | - |
dc.subject | shift of finite type | - |
dc.subject | symbolic dynamics | - |
dc.title | Markov capacity for factor codes with an unambiguous symbol | - |
dc.type | Article | - |
dc.identifier.doi | 10.1017/etds.2023.103 | - |
dc.identifier.scopus | eid_2-s2.0-85176575799 | - |
dc.identifier.volume | 44 | - |
dc.identifier.issue | 8 | - |
dc.identifier.spage | 2199 | - |
dc.identifier.epage | 2228 | - |
dc.identifier.eissn | 1469-4417 | - |
dc.identifier.issnl | 0143-3857 | - |