4. r-Balls and I-Balls
Let
be a vector in the space
with
-poset metric
and
. With center at
and radius
r, the
r-
ball and the
r-
sphere, respectively, are as follows:
It is clear that
.
Definition 1. Let C be a code of with -poset metric . Then C is said to be a r-perfect -poset code if the r-balls centered at the codewords of C are pairwise disjoint and their union is .
Let
be such that
and
has exactly
s maximal elements. We let
. Given a vector
of
, we rewrite it as
where for each
,
is an element in
satisfying:
- (i)
-
If ,,
where for some ;
- (ii)
If , ;
- (iii)
If ,.
Observe that
. Now, letting
the collection of all vectors
in
such that
, we have
Obviously, for two distinct ideals
I and
J in
,
. Now, we denote by
the set of all ideals
such that
, and
I has exactly
s maximal elements. Then the number of vectors in an
r-ball with center
equals
Given an ideal
, the
I-
ball centered at
and the
I-
sphere centered at
, respectively, are defined as
Definition 2. Let C be a code of with -poset metric and I be an ideal in . Then C is called an I-perfect -poset code if the I-balls centered at the codewords of C are pairwise disjoint and their union is .
Under pomset metric
in
, it was shown in [
9] that
I-balls are no more linear subspaces of
if
I is an ideal with partial count in
. On the other hand, with
-poset metric, the
I-ball centered at the zero vector is a submodule of
.
Proposition 3. Let . Then is a submodule of .
Proof. Clearly, if I is an ideal with full count in , then is a submodule of with dimension . Now, suppose that I is an ideal with partial count. Then . For each , let for some . By considering as a subgroup of such that for , for , we have for all . It follows that for . Hence, is a submodule of . □
For , let denote the -ball centered at under the poset .
Proposition 4. Let . Then the following statements hold:
-
1.
For , .
-
2.
-
For , and are either identical or disjoint. Moreover,
.
-
3.
.
Proof. (1) Let . It follows that , and . For , we have . Hence .
(2) For each , we let be a subgroup of such that , where . For , suppose . We have and . If , then , so . For the case , we have , which implies . That is, for all . Consequently, , which means that .
(3) If I is an ideal with full count in , then is also an ideal with full count in . Since and , we derive the result.
Next, suppose that , where are distinct primes, and the mset . Let be an ideal with partial count. From , for each , we let for some , where , and let and be subgroups of such that and . Then and . Let and . Then , where for each i, and . It follows that is congruent to 0 modulo m. That is, . Now, we assume that there is . Since for all , we can, without loss of generality, write , where and . Then , where and for some . Choosing , defined by for all , and , it follows that modulo m, which is a contradiction. □
Example 5. Consider and the mset . On , we choose . The structure of each when , is demonstrated via the lattice of nontrivial subgroup for (see in Figure 3) in which , , and . Now let us consider the poset , where the poset is as shown in Figure 1. Let . Then I is an ideal with partial count. It is easy to see that , whereas .
Observe that the I-ball centered at the zero vector can be considered as a direct product of cyclic subgroups of . If m is a prime power, the following result is directly obtained.
Proposition 5. In the space , let .Then
-
1.
If , then and .
-
2.
-
If , then
and ,
where for each , for some .
From Proposition 3 and 4, the following theorem shows the existence of an I-perfect code with -poset metric when I is an ideal with full count.
Theorem 2. For any ideal I with full count in , we have
-
1.
is an I-perfect -poset code for the poset .
-
2.
is an -perfect -poset code for the poset .
In the case of ideals I with partial count, the I-ball centered at the zero vector is not always I-perfect. The next lemma is a key for the existence of I-perfect code with -poset metric.
For each , let be such that if , and .
Lemma 1. Let with . For each , let be a nontrivial subgroup of such that . Then the following statements hold:
-
1.
If there is such that , then there is no I-perfect -poset code.
-
2.
Suppose C is an I-perfect -poset code of . Then for each , there is a maximal subgroup of such that . Moreover, and .
Proof. (1) Suppose that . Choose , where . Then . It follows that . Suppose there is an I-perfect -poset code C of . Then for some . That is, . This implies that which means . From , there is such that and . Consequently, . As a submodule of , we have , which is a contradiction to the I-perfect of C.
(2) Suppose C is an I-perfect -poset code of . Let . From (1), . Then there is a maximal subgroup of such that . Let . Consider . Then . We choose such that . Since , it follows that and . Indeed, by proceeding as before, we have . That is, . Since , we have which means . Then for some . From , we have . Then there is such that and modulo m. Thus, modulo m. These force . Hence, . That is, . Since C is I-perfect, by a similar technique, it can be shown that . □
Given an mset A, let .
Theorem 3. Let with . Then is an I-perfect -poset code of if and only if for each , for some .
Proof. Suppose is I-perfect. By Proposition 4(3), . For the necessary condition, let . We have and , where two subgroups are as in Lemma 1. Then .
For each , we have that and . These imply that and . Hence, the converse is proved. □
Corollary 1. There is no I-perfect -poset code of if I is an ideal with partial count in .
Example 6. In Example 5, we have with , but . Consider the poset as in Figure 1. In the space with -poset metric, we let as an ideal with partial count. By Theorem 3, we have is an I-perfect -poset code of .