Rationality and computability of the covering radius for sofic shifts
Fuente:
arXiv
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Preprint |
| Published: |
2026
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866917356848021504 |
|---|---|
| author | Meyerovitch, Tom Young, Aidan |
| author_facet | Meyerovitch, Tom Young, Aidan |
| contents | The covering radius of a shift space is a quantity of interest for information-theoretic applications of data transmission over noisy channels. We prove that the covering radius of a primitive sofic shift is a rational number, and describe an algorithm to compute the covering radius from a labeled graph presentation. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2603_21449 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Rationality and computability of the covering radius for sofic shifts Meyerovitch, Tom Young, Aidan Dynamical Systems Information Theory The covering radius of a shift space is a quantity of interest for information-theoretic applications of data transmission over noisy channels. We prove that the covering radius of a primitive sofic shift is a rational number, and describe an algorithm to compute the covering radius from a labeled graph presentation. |
| title | Rationality and computability of the covering radius for sofic shifts |
| topic | Dynamical Systems Information Theory |
| url | https://arxiv.org/abs/2603.21449 |