(T, U) mapping matrices: properties and applications in permutation decoding

Abstract

Properties of mapping matrices which define the connection of the /spl gamma/-type error patterns in different domains are presented. Using their properties, we can define the capability of the s-step (T, U) permutation decoding method. These properties can also be extended to other permutation decoding methods which use the elements other than p (the characteristic of GF(q)) as multipliers.<>