• Title/Summary/Keyword: chain ring

Search Result 236, Processing Time 0.027 seconds

GLIFT CODES OVER CHAIN RING AND NON-CHAIN RING Re,s

  • Elif Segah, Oztas
    • Bulletin of the Korean Mathematical Society
    • /
    • v.59 no.6
    • /
    • pp.1557-1565
    • /
    • 2022
  • In this paper, Glift codes, generalized lifted polynomials, matrices are introduced. The advantage of Glift code is "distance preserving" over the ring R. Then optimal codes can be obtained over the rings by using Glift codes and lifted polynomials. Zero divisors are classified to satisfy "distance preserving" for codes over non-chain rings. Moreover, Glift codes apply on MDS codes and MDS codes are obtained over the ring 𝓡 and the non-chain ring 𝓡e,s.

A PROPERTY OF P-INJETIVE RING

  • Hong, Chan-Yong
    • The Mathematical Education
    • /
    • v.31 no.2
    • /
    • pp.141-144
    • /
    • 1992
  • In this paper, some properties of p-injective ring is studied: The Jacobson radical of a pinjective ring which satisfies the ascending chain condition on essential left ideals is nilpotent. Also, the left singular ideal of a ring which satisfies the ascending chain condition on essential left ideals is nilpotent. Finally, we give an example which shows that a semiprime left p-injective ring such that every essential left ideal is two-sided is not necessarily to be strongly regular.egular.

  • PDF

CONSTRUCTION FOR SELF-ORTHOGONAL CODES OVER A CERTAIN NON-CHAIN FROBENIUS RING

  • Kim, Boran
    • Journal of the Korean Mathematical Society
    • /
    • v.59 no.1
    • /
    • pp.193-204
    • /
    • 2022
  • We present construction methods for free self-orthogonal (self-dual or Type II) codes over ℤ4[v]/〈v2 + 2v〉 which is one of the finite commutative local non-chain Frobenius rings of order 16. By considering their Gray images on ℤ4, we give a construct method for a code over ℤ4. We have some new and optimal codes over ℤ4 with respect to the minimum Lee weight or minimum Euclidean weight.

MAXIMAL CHAIN OF IDEALS AND n-MAXIMAL IDEAL

  • Hemin A. Ahmad;Parween A. Hummadi
    • Communications of the Korean Mathematical Society
    • /
    • v.38 no.2
    • /
    • pp.331-340
    • /
    • 2023
  • In this paper, the concept of a maximal chain of ideals is introduced. Some properties of such chains are studied. We introduce some other concepts related to a maximal chain of ideals such as the n-maximal ideal, the maximal dimension of a ring S (M. dim(S)), the maximal depth of an ideal K of S (M.d(K)) and maximal height of an ideal K(M.d(K)).

THE STRONG MORI PROPERTY IN RINGS WITH ZERO DIVISORS

  • ZHOU, DECHUAN;WANG, FANGGUI
    • Bulletin of the Korean Mathematical Society
    • /
    • v.52 no.4
    • /
    • pp.1285-1295
    • /
    • 2015
  • An SM domain is an integral domain which satisfies the ascending chain condition on w-ideals. Then an SM domain also satisfies the descending chain condition on those chains of v-ideals whose intersection is not zero. In this paper, a study is begun to extend these properties to commutative rings with zero divisors. A $Q_0$-SM ring is defined to be a ring which satisfies the ascending chain condition on semiregular w-ideals and satisfies the descending chain condition on those chains of semiregular v-ideals whose intersection is semiregular. In this paper, some properties of $Q_0$-SM rings are discussed and examples are provided to show the difference between $Q_0$-SM rings and SM rings and the difference between $Q_0$-SM rings and $Q_0$-Mori rings.

ON THE CHAIN CONDITIONS OF A FAITHFUL ENDO-FLAT MODULE

  • Bae, Soon-Sook
    • Communications of the Korean Mathematical Society
    • /
    • v.14 no.1
    • /
    • pp.1-12
    • /
    • 1999
  • The faithful bi-module \ulcornerM\ulcorner with its endomorphism ring End\ulcorner(M) such that M\ulcorner is flat (in other words, End\ulcorner(M)-flat, or endo-flat)and with a commutative ring R containing an identity has been studied in this paper. The chain conditions of a faithful endo-flat module \ulcornerM relative to those of the endomorphism ring End\ulcorner(M) having the zero annihilator of each non-zero endomorphism are studied.

  • PDF

Composite Hurwitz Rings Satisfying the Ascending Chain Condition on Principal Ideals

  • Lim, Jung Wook;Oh, Dong Yeol
    • Kyungpook Mathematical Journal
    • /
    • v.56 no.4
    • /
    • pp.1115-1123
    • /
    • 2016
  • Let $D{\subseteq}E$ be an extension of integral domains with characteristic zero, I be a nonzero proper ideal of D and let H(D, E) and H(D, I) (resp., h(D, E) and h(D, I)) be composite Hurwitz series rings (resp., composite Hurwitz polynomial rings). In this paper, we show that H(D, E) satisfies the ascending chain condition on principal ideals if and only if h(D, E) satisfies the ascending chain condition on principal ideals, if and only if ${\bigcap}_{n{\geq}1}a_1{\cdots}a_nE=(0)$ for each infinite sequence $(a_n)_{n{\geq}1}$ consisting of nonzero nonunits of We also prove that H(D, I) satisfies the ascending chain condition on principal ideals if and only if h(D, I) satisfies the ascending chain condition on principal ideals, if and only if D satisfies the ascending chain condition on principal ideals.

Faultless Protection Methods in Self-Healing Ethernet Ring Networks

  • Lee, Kwang-Koog;Ryoo, Jeong-Dong;Joo, Bheom Soon
    • ETRI Journal
    • /
    • v.34 no.6
    • /
    • pp.816-826
    • /
    • 2012
  • Self-healing Ethernet rings show promise for realizing the SONET/SDH-grade resilience in Carrier Ethernet infrastructures. However, when a ring is faulty, high-priority protection messages are processed in less time than low-priority data frames are processed. In this situation, any delayed data frames either being queued or traveling through long ring spans will cause the ring nodes to generate incorrect forwarding information. As a result, the data frames spread in the wrong direction, causing the ring to become unstable. To solve this problem, we propose four schemes, that is, dual flush, flush delay timer setting, purge triggering, and priority setting, and evaluate their protection performance under various traffic conditions on a ring based on the Ethernet ring protection (ERP) method. In addition, we develop an absorbing Markov chain model of the ERP protocol to observe how traffic congestion can impact the protection performance of the proposed priority setting scheme. Based on our observations, we propose a more reliable priority setting scheme, which guarantees faultless protection, even in a congested ring.