Abstract:
We suggest a code construction method that yields codes correcting $t$ errors in the modulus metric with asymptotically minimum redundancy. We introduce a concept of metric homomorphism and prove the homomorphism of the transposition metric to the Lee metric and the modulus metric. New code families for the mentioned metrics are constructed.