• 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.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.9
• /
• pp.4788-4813
• /
• 2019

In this paper, we introduce concepts of optimal and near optimal secret data hiding schemes. We present a new digital image steganography approach based on the Galois field $GF(p^m)$ using graph and automata to design the data hiding scheme of the general form ($k,N,{\lfloor}{\log}_2p^{mn}{\rfloor}$) for binary, gray and palette images with the given assumptions, where k, m, n, N are positive integers and p is prime, show the sufficient conditions for the existence and prove the existence of some optimal and near optimal secret data hiding schemes. These results are derived from the concept of the maximal secret data ratio of embedded bits, the module approach and the fastest optimal parity assignment method proposed by Huy et al. in 2011 and 2013. An application of the schemes to the process of hiding a finite sequence of secret data in an image is also considered. Security analyses and experimental results confirm that our approach can create steganographic schemes which achieve high efficiency in embedding capacity, visual quality, speed as well as security, which are key properties of steganography.

• Bulletin of the Korean Mathematical Society
• /
• v.12 no.2
• /
• pp.57-64
• /
• 1975

• Journal of the Korean Mathematical Society
• /
• v.22 no.2
• /
• pp.117-124
• /
• 1985

• Proceedings of the IEEK Conference
• /
• 2004.08c
• /
• pp.503-508
• /
• 2004

This paper proposes an efficient computation method for fixed and mixed polarity Reed -Muller function vector over Galois field GF(p). Function vectors of fixed polarity Heed Muller function with single variable can be generated by proposed method. The n-variable function vectors can be calculated by means of the Kronecker product of a single variable function vector corresponding to each variable. Thus, all fixed and mixed polarity Reed-Muller function vectors are calculated directly without using a polarity function vector table or polarity coefficient matrix.

• Journal of Communications and Networks
• /
• v.12 no.5
• /
• pp.406-410
• /
• 2010

This paper presents an approach to the construction of non-binary quasi-cyclic (QC) low-density parity-check (LDPC) codes based on multiplicative groups over one Galois field GF(q) and Euclidean geometries over another Galois field GF($2^S$). Codes of this class are shown to be regular with girth $6{\leq}g{\leq}18$ and have low densities. Finally, simulation results show that the proposed codes perform very wel with the iterative decoding.

• Journal of Communications and Networks
• /
• v.16 no.3
• /
• pp.249-257
• /
• 2014

This paper presents methods to the construction of regular and irregular low-density parity-check (LDPC) codes based on Euclidean geometries over the Galois field. Codes constructed by these methods have quasi-cyclic (QC) structure and large girth. By decomposing hyperplanes in Euclidean geometry, the proposed irregular LDPC codes have flexible column/row weights. Therefore, the degree distributions of proposed irregular LDPC codes can be optimized by technologies like the curve fitting in the extrinsic information transfer (EXIT) charts. Simulation results show that the proposed codes perform very well with an iterative decoding over the AWGN channel.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.42 no.11
• /
• pp.13-20
• /
• 2005

For Modern Consumer and Communication Elecronic Devices, Always Error Protecting HW and SW is used. The Core is RS(Reed Solomon) Codec in Galois Field GF($2^8$). Here New 2 to 3 Symbol RS Decoder Design and Encoder design Method using Normalized error position Value is described. Examples are given to show the methods are working well.

• Journal of the Chungcheong Mathematical Society
• /
• v.30 no.1
• /
• pp.77-102
• /
• 2017

As an analogy of $Poincar{\acute{e}}$ series in the space of modular forms, T. Ono associated a module $M_c/P_c$ for ${\gamma}=[c]{\in}H^1(G,R^{\times})$ where finite group G is acting on a ring R. $M_c/P_c$ is regarded as the 0-dimensional twisted Tate cohomology ${\hat{H}}^0(G,R^+)_{\gamma}$. In the case that G is the Galois group of a Galois extension K of a number field k and R is the ring of integers of K, the vanishing properties of $M_c/P_c$ are related to the ramification of K/k. We generalize this to arbitrary n-dimensional twisted cohomology of the ring of integers and obtain the extended version of theorems. Moreover, some explicit examples on quadratic and biquadratic number fields are given.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.10 no.1
• /
• pp.42-47
• /
• 1985

An efficient logic circuit for realizing the function which has output of 1 diagonaly and design for multivalued logic circuit using with ROM structure which has two output at once are presented. The circuits presented are suited for the circuit design of a symmetric multivalued truth tables and the circuit design of multivalued truth tables with many independent variables. Also, they are applied to the multivalued truth tables of Galois field(GF).