Codes of Length Two Correcting Single Errors of Limited Size II
Linear codes of length 2 over the integers modulo some integer q that can correct single errors of limited size are considered. A code can be determined by a check pair of integers. The errors e considered are in the range \(-\mu \le e \le \lambda \), such a code can only exist for q sufficiently large. The main content of this note is to make this statement precise, that is, to determine “q sufficiently large” in terms of the integers \(-\mu \) and \(\lambda \).
KeywordsError correcting code Errors of limited size Integers modulo n
- 1.Battaglioni, M., Chiaraluce, F., Kløve, T.: On non-linear codes correcting errors of limited size. In: Proceedings of the Globecom, Singapore, 4–8 December 2017, pp. 1–7. IEEE Xplore (2017)Google Scholar
- 6.Kløve, T.: Codes of length two correcting single errors of limited size. In: Cryptography and Communications (to appear)Google Scholar