12 research outputs found
ON PRIMARY COMPACTLY PACKED BEZOUT MODULES
Many results are proved concerning primary compactly packed modules and primary radical submodules. We also generalize some results that were proved on S-closed subset of modules and prime submodules to Sclosed subset of modules and primary submodules. Furthermore, we find the conditions on an R-module M that make the following important result true, that is for a multiplication Bezout module M, M is primary compactly packed if and only if every primary submodule of M is primary compactly packed
LINEAR CODES OVER Z4 USING ALMOST-GREEDY ALGORITHM
In this paper we prove thate the almost-greedy and almost self- orthogonal greedy codes over Z4 with Lee distance are linear when they are generated by using the B-ordering and the almost-greedy algorithm of any ordered basis over Z4
LINEAR CODES OVER Z4 USING ALMOST-GREEDY ALGORITHM
In this paper we prove thate the almost-greedy and almost self- orthogonal greedy codes over Z4 with Lee distance are linear when they are generated by using the B-ordering and the almost-greedy algorithm of any ordered basis over Z