Abstract Berlekamp and Zigangirov completely determined the capacity error function for binary error correcting codes with noiseless feedback. It is still an unsolved problem if the upper bound for the capacity error function in the non-binary case of Ahlswede, Lebedev, and Deppe is sharp. We consider wraparound channels with limited magnitude and noiseless feedback. We completely determine the capacity error function for all q -ary wraparound channels with a magnitude of level r . All of our algorithms use partial noiseless feedback. Furthermore, a special case of the problem is equivalent to Shannon’s zero-error problem.

中文翻译：

---

具有有限幅值和反馈的 q 进制纠错码算法

摘要 Berlekamp和Zigangirov完全确定了无噪声反馈二进制纠错码的容量误差函数。如果 Ahlswede、Lebedev 和 Deppe 的非二元情况下的容量误差函数的上限是尖锐的，这仍然是一个未解决的问题。我们考虑具有有限幅度和无噪声反馈的环绕通道。我们完全确定了大小为 r 的所有 q 元环绕通道的容量误差函数。我们所有的算法都使用部分无噪声反馈。此外，该问题的一个特例等价于香农的零错误问题。