Nonbinary codes correcting localized errors
Rudolf Ahlswede, Leonid Alexandrovich Bassalygo, M.S. Pinsker · IEEE Transactions on Information Theory · 1993
A recursive construction of asymptotically dense codes correcting a constant number of localized errors is examined. The codes overcome difficulties for a particular case with an asymptotic Hamming bound in which the number of errors increases linearly with the length of codes. It is shown that this method is applicable to both binary and nonbinary cases.>