2 articles in this issue
S. Azab,M Zayed,M. Atrash,M. Ashker
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.
N. Fathy,Jasser Sarsuor,Z. Safi
For any locally convex space E, the bounded set D is precompact if and only if linm (sn(D,U))=0 for any nhood of zero in E. In this work we study some type of precompact (which are called - compact) sets whose sequences of n-diameters converges to zero in... see more