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.

翻译：平移空间的覆盖半径是衡量在噪声信道上数据传输信息论应用中的一个重要量。我们证明了本原sofic shift的覆盖半径是一个有理数，并描述了一种从带标号图表示中计算覆盖半径的算法。