• Korean Journal of Mathematics
• /
• v.25 no.2
• /
• pp.163-179
• /
• 2017

In this paper, we introduce the notion of left derivations of BCH algebras and investigate some properties of left derivations in a BCH-algebra. Moreover, we introduce the notions of fixed set and kernel set of derivations in a BCH-algebra and obtained some interesting properties in medial BCH-algebras. Also, we discuss the relations between ideals in a medial BCH-algebras.

• Journal of applied mathematics & informatics
• /
• v.40 no.5_6
• /
• pp.1105-1115
• /
• 2022

The main objective of this paper is to introduce the notion of AMR-algebra and its generalization, and to compare them with other algebras such as BCK, BCI, BCH, · · ·, etc. We show moreover that the K-part of AMR-algebra is an abelian group, and the weak AMR-algebra is also an abelian group and generalizes many known algebras like BCI, BCH, and G.

• East Asian mathematical journal
• /
• v.22 no.2
• /
• pp.207-213
• /
• 2006

Using the notion of nilpotent elements, the concept of nil subsets is introduced, and related properties are investigated. We show that a nil subset on a subalgebra (resp. (closed) ideal) is a subalgebra (resp. (closed) ideal). We also prove that in a nil algebra every ideal is a subalgebra.

• Journal of the Chungcheong Mathematical Society
• /
• v.29 no.1
• /
• pp.37-48
• /
• 2016

The aim of this paper is to introduce the notion of a generalized derivations of BCH-algebras and some related properties are investigated.

• Journal of the Chungcheong Mathematical Society
• /
• v.28 no.4
• /
• pp.561-573
• /
• 2015

The aim of this paper is to introduce the notion of left-right (resp. right-left) symmetric bi-derivation of BCH-algebras and some related properties are investigated.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.15 no.9
• /
• pp.3458-3481
• /
• 2021

Existing methods for blind identification of linear block codes without a candidate set are mainly built on the Gauss elimination process. However, the fault tolerance will fall short when the intercepted bit error rate (BER) is too high. To address this issue, we apply the reverse algebra approach and propose a novel "two-step-screening" algorithm by solving the linear error equations on the binary Galois field, or GF(2). In the first step, a recursive matrix partition is implemented to solve the system linear error equations where the coefficient matrix is constructed by the full codewords which come from the intercepted noisy bitstream. This process is repeated to derive all those possible parity-checks. In the second step, a check matrix constructed by the intercepted codewords is applied to find the correct parity-checks out of all possible parity-checks solutions. This novel "two-step-screening" algorithm can be used in different codes like Hamming codes, BCH codes, LDPC codes, and quasi-cyclic LDPC codes. The simulation results have shown that it can highly improve the fault tolerance ability compared to the existing Gauss elimination process-based algorithms.