Suppose we're working with $F_8=\{0,1,2,3,4,5,6,7\}$ and each of message has length of $n$. Is it possible to construct an error correction code such that it corrects $n$ errors, and each error is off by $\pm1$?
For example, if the original message is $666$, the corrupted version can be $555, 556, 557, 565, \cdots, 777$.
I'm totally new to the topic of error correction codes and have no clue how to proceed. Can you guys shed some light on it?