In this paper, bounds are derived on the minimum homogeneous distance of the image of a linear block code over the Galois ring GR(p, m), with respect to any basis of GR(p, m). These bounds depend on the parameters of GR(p, m), the minimum Hamming distance of the block code, and the average value of the homogeneous weight applied on the base ring Zpr . Examples are given of Galois ring codes tha...

This paper investigates the usefulness of block partitioning in cluster computing in light of recent network improvements such as FDDI and high-speed switch technology. Mathematical characterizations of the communication costs for contiguous partitioning and block decomposition in both a ring-connected and switched network are presented. Simulations of ring and switch technologies indicate that...

in this note we introduce the notion of weak mccoy rings as a generalization of mccoy rings, and investigate their properties. also we show that, if is a semi-commutative ring, then is weak mccoy if and only if is weak mccoy.

BACKGROUND Report of three patients with pseudophakic angle-closure from a Soemmering ring. Three mechanisms of the Soemmering ring induced pseudophakic angle-closure in three patients were demonstrated by meticulous anterior segment examination and ultrasound biomicroscopic (UBM) analysis. CASE PRESENTATION In the first case, the Soemmering-capsule-IOL complex caused relative pupillary block...

An n-block is a sequence b, b,. b,, where b, E Z, for 1 < i < n, and an n-block map is a function from the set of n-blocks to the ring Z,. The n-block maps form the ring GF(2) {x,. x1,..., x, 1 xf = 1). The set of all block maps with the operations of addition and polynomial substitution form a near-ring. The general problem of searching non-linear block maps for factors with respect to polynom...