arXiv · 2603.21449
Rationality and computability of the covering radius for sofic shifts
Abstract
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.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Tom Meyerovitch, Aidan Young. 2026-03-22. Rationality and computability of the covering radius for sofic shifts. https://arxiv.org/abs/2603.21449
Cite the original work for its findings. Save a collection to share your selection of sources.