• Bulletin of the Korean Mathematical Society
• /
• v.54 no.5
• /
• pp.1779-1801
• /
• 2017

Let X be a minimal del Pezzo surface of degree 2 over a finite field ${\mathbb{F}}_q$. The image ${\Gamma}$ of the Galois group Gal(${\bar{\mathbb{F}}}_q/{\mathbb{F}}_q$) in the group Aut($Pic({\bar{X}})$) is a cyclic subgroup of the Weyl group W($E_7$). There are 60 conjugacy classes of cyclic subgroups in W($E_7$) and 18 of them correspond to minimal del Pezzo surfaces. In this paper we study which possibilities of these subgroups for minimal del Pezzo surfaces of degree 2 can be achieved for given q.

• Journal of Communications and Networks
• /
• v.12 no.1
• /
• pp.11-18
• /
• 2010

Diversity-multiplexing tradeoff (DMT) is an efficient tool to measure the performance of multiple-input and multiple-output (MIMO) systems and cooperative systems. Recently, cooperative multicast system with wireless network coding stretched tremendous interesting due to that it can drastically enhance the throughput of the wireless networks. It is desirable to apply DMT to the performance analysis on the multicast system with wireless network coding. In this paper, DMT is performed at the three proposed wireless network coding protocols, i.e., non-regenerative network coding (NRNC), regenerative complex field network coding (RCNC) and regenerative Galois field network coding (RGNC). The DMT analysis shows that under the same system performance, i.e., the same diversity gain, all the three network coding protocols outperform the traditional transmission scheme without network coding in terms of multiplexing gain. Our DMT analysis also exhibits the trends of the three network coding protocols' performance when multiplexing gain is changing from the lower region to the higher region. Monte-Carlo simulations verify the prediction of DMT.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.9 no.4
• /
• pp.3-10
• /
• 1999

More concerns are concentrated in finite fields arithmetic as finite fields being applied for Elliptic curve cryptosystem coding theory and etc. Finite fields arithmetic is affected in represen -tation of those. Optimal normal basis is effective in hardware implementation and polynomial field which is effective in the basis conversion with optimal normal basis and show that the arithmetic of finite field with the basis is effective in software implementation.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.2
• /
• pp.714-727
• /
• 2015

The hierarchical structure in networks is widely applied in many practical scenarios especially in some emergency cases. In this paper, we focus on a tree network with and without packet loss where one source sends data to n destinations, through m relay nodes employing random linear network coding (RLNC) over a Galois field in parallel transmission systems. We derive closed-form probability expressions of successful decoding at a destination node and at all destination nodes in this multicast scenario. For the convenience of computing, we also propose an upper bound for the failure probability. We then investigate the impact of the major parameters, i.e., the size of finite fields, the number of internal nodes, the number of sink nodes and the channel failure probability, on the decoding performance with simulation results. In addition, numerical results show that, under a fixed exact decoding probability, the required field size can be minimized. When failure decoding probabilities are given, the operation is simple and its complexity is low in a small finite field.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.17 no.4
• /
• pp.83-93
• /
• 2017

In everyday life, the ratio of credit card aspect ratio is 1: 1.56, and A4 printer paper is 1: 1.414, which is relatively balanced golden ratio. In this paper, we show the Fibonacci Golden ratio as a polynomial based on the golden ratio, which is the most balanced and ideal visible ratio, and show that the application of Euler and symmetric jacket polynomial is related to BPSK and QPSK constellation. As a proof method, we have derived Fibonacci Golden and Galois field element polynomials. Then mathematically, We have newly derived a golden jacket code that can be used to generate an appropriate code with orthogonal properties and can simply be used for inverse calculation. We also obtained a channel capacity according to the channel correlation change using a block jacket matrix in a MIMO mobile communication.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.25 no.11B
• /
• pp.1864-1871
• /
• 2000

본 논문에서는 차세대 무선 통신 시스템에 적용이 가능한 새로운 FEC(Forward Error Correction) 부호화 방법으로 MLC(Multi-Level Convolutional) 부호화 방식을 제안한다. 차세대 무선통신서비스는 음성, 데이터, 영상 등 많은 종류의 서비스를 함으로써 데이터의 처리속도가 빠른 시스템이 요구된다. 데이터 처리시간을 단축시키기 위한 방법으로 다중 레벨을 이용하여 부호어를 만들어 내는 방식의 부호화 시스템을 설계하였다. MLC는 부호 처리시간을 단축시킬 뿐만 아니라 다양한 알고리즘을 이용해 부호어를 만들어 낼 수 있다는 특징을 가지게 된다. 모의실험은 MLC 코드의 두 가지 방법, Modulo- operation 방식과 Galois Field-Operation 방식을 이용하여 수행하였다. 또한 모의실험을 통하여 (s=2, T=2)인 경우가 MLC 부호기의 최적 연결다항식임을 알았다.

• Journal of the Korean Mathematical Society
• /
• v.38 no.3
• /
• pp.623-631
• /
• 2001

Let $\kappa$ be a real abelian field of conductor f and $\kappa$(sub)$\infty$ = ∪(sub)n$\geq$0$\kappa$(sub)n be its Z(sub)p-extension for an odd prime p such that płf$\phi$(f). he aim of this paper is ot compute the cohomology groups of circular units. For m>n$\geq$0, let G(sub)m,n be the Galois group Gal($\kappa$(sub)m/$\kappa$(sub)n) and C(sub)m be the group of circular units of $\kappa$(sub)m. Let l be the number of prime ideals of $\kappa$ above p. Then, for mm>n$\geq$0, we have (1) C(sub)m(sup)G(sub)m,n = C(sub)n, (2) H(sup)i(G(sub)m,n, C(sub)m) = (Z/p(sup)m-n Z)(sup)l-1 if i is even, (3) H(sup)i(G(sub)m,n, C(sub)m) = (Z/P(sup)m-n Z)(sup l) if i is odd (※Equations, See Full-text).

• IEIE Transactions on Smart Processing and Computing
• /
• v.6 no.3
• /
• pp.210-219
• /
• 2017

This paper proposes a modified min-max algorithm (MMMA) for nonbinary quasi-cyclic low-density parity-check (NB-QC-LDPC) codes and an efficient parallel block-layered decoder architecture corresponding to the algorithm on a graphics processing unit (GPU) platform. The algorithm removes multiplications over the Galois field (GF) in the merger step to reduce decoding latency without any performance loss. The decoding implementation on a GPU for NB-QC-LDPC codes achieves improvements in both flexibility and scalability. To perform the decoding on the GPU, data and memory structures suitable for parallel computing are designed. The implementation results for NB-QC-LDPC codes over GF(32) and GF(64) demonstrate that the parallel block-layered decoding on a GPU accelerates the decoding process to provide a faster decoding runtime, and obtains a higher coding gain under a low $10^{-10}$ bit error rate and low $10^{-7}$ frame error rate, compared to existing methods.

• Journal of Korea Society of Industrial Information Systems
• /
• v.7 no.3
• /
• pp.1-8
• /
• 2002

Modular Multiplication in Galois Field GF(2/sup m/) is a basic operation for many applications, particularly for public key cryptography. This paper presents a new architecture that can process modular multiplication on GF(2/sup m/) per m clock cycles using a cellular automata. Proposed architecture is more efficient in terms of the space and time than that of systolic array. Furthermore it can be efficiently used for the hardware design for exponentiation computation.

• Honam Mathematical Journal
• /
• v.32 no.1
• /
• pp.45-51
• /
• 2010

Let A be an abelian variety defined over a number field K and let L be a cyclic extension of K with Galois group G = <${\sigma}$> of order n. Let III(A/K) and III(A/L) denote, respectively, the Tate-Shafarevich groups of A over K and of A over L. Assume III(A/L) is finite. Let M(x) be a companion matrix of 1+x+${\cdots}$+$x^{n-1}$ and let $A^x$ be the twist of $A^{n-1}$ defined by $f^{-1}{\circ}f^{\sigma}$ = M(x) where $f:A^{n-1}{\rightarrow}A^x$ is an isomorphism defined over L. In this paper we compute [III(A/K)][III($A^x$/K)]/[III(A/L)] in terms of cohomology, where [X] is the order of an finite abelian group X.