On Isometric Error-Correcting Codes over Finite Fields of Prime Order
Tena Ipsilantis Katsaounis · Journal of Informatics and Mathematical Sciences · 2018
Error-correcting codes obtained from each other via a Hamming distance preserving transformation, called isometry, are equivalent. In this paper, we consider three different isometries which yield permutationally equivalent linear codes, monomially equivalent linear codes, and equivalent nonlinear codes, respectively. For each case, we derive some new necessary and sufficient conditions for equivalence using the concept of weight vector of a code or distance matrix of a code. Results hold for error-correcting codes over a finite field of prime order.