Block codes on pomset metric

Given a regular multiset M on [n] = {1, 2, ... , n}, a partial order R on M, and a label map p : [n] ? N defined by p(i) = k(i) with S-i=1(n) p(i) = N, we define a pomset block metric d(P m,p) on the direct sum Z(m)(k1) (R) Z(m)(k2) (R) . . . (R) Z(m)(kn) of Z(m)(N) based on the pomset P = (M, R). The pomset block metric extends the classical pomset metric introduced by Sudha and Selvaraj and generalizes the poset block metric introduced by Alves et al. over Zm. The space (Z(m)(N),( d)((P m,p))) is called the pomset block space and we determine the complete weight distribution of it. Further, I -perfect pomset block codes for ideals with partial and full counts are described. Then, for block codes with chain pomset, the packing radius and Singleton bound are established. The relation between maximum distance separable (MDS) codes and I -perfect codes for any ideal I is investigated. Moreover, the duality theorem for an MDS pomset block code is established when all the blocks have the same size.