• Bulletin of the Korean Mathematical Society
• /
• v.52 no.3
• /
• pp.915-923
• /
• 2015

Self-dual codes have been actively studied because of their connections with other mathematical areas including t-designs, invariant theory, group theory, lattices, and modular forms. We presented the building-up construction for self-dual codes over GF(q) with $q{\equiv}1$ (mod 4), and over other certain rings (see [19], [20]). Since then, the existence of the building-up construction for the open case over GF(q) with $q=p^r{\equiv}3$ (mod 4) with an odd prime p satisfying $p{\equiv}3$ (mod 4) with r odd has not been solved. In this paper, we answer it positively by presenting the building-up construction explicitly. As examples, we present new optimal self-dual [16, 8, 7] codes over GF(7) and new self-dual codes over GF(7) with the best known parameters [24, 12, 9].

• Proceedings of the Korean Society For Composite Materials Conference
• /
• 2002.10a
• /
• pp.249-251
• /
• 2002

It is well known that the interaction and adhesion between the glass fiber(GF) and polymer matrix has a significant effect in determining the properties of fiber-reinforced materials. Therefore, it is one of most important to modify the surface of GF with an appropriate sizing. We investigated the treatment method of GF with coupling agent to improve the interaction of the interfacial regions, and then the correlation between interfacial property and interphase microstructure was examined in an attempt to realize a proper morphology around the GF surface.

• Journal of IKEEE
• /
• v.3 no.2 s.5
• /
• pp.285-294
• /
• 1999

This paper presents a method for the generation of GRM coefncients over GF(3) by using a comparison of polarity. In general production method to GRM coefficients over GF(3) is searching for pn different polarity of an n-variable and from these optimal function according to the maximum number of zero coefficients is selected. This paper presents a method for the generation of GRM coefficients by means of compare to the number of zero coefficients without constructing the whole polarity GRM coefficients.

• Proceedings of the IEEK Conference
• /
• 1999.06a
• /
• pp.333-336
• /
• 1999

In this paper, a new high speed parallel input and parallel output GF(2$^{m}$ ) multiplier based on standard basis is proposed. The concept of the multiplication in standard basis coordinates gives an easier VLSI implementation than that of the dual basis. This proposed algorithm and method of implementation of the GF(2$^{m}$ ) multiplication are represented by two kinds of basic cells (which are the generalized and fixed basic cell), and the minimum critical path with pipelined operation. In the case of the generalized basic cell, the proposed multiplier is composed of $m^2$ basic cells where each cell has 2 two input AND gates, 2 two input XOR gates, and 2 one bit latches Specifically, we show that the proposed multiplier has smaller complexity than those proposed in 〔5〕.

• Elastomers and Composites
• /
• v.52 no.1
• /
• pp.1-8
• /
• 2017

Hydrolysis resistance and mechanical property changes of polyketone (POK)/glass fiber (GF) composites were investigated for GF concentrations varying between 30 and 50%. The hydrolysis resistance of GF filled POK and polyamide66 (PA66, hydrolysis resistant grade) composites were compared. As shown by the experimental results, increasing the immersion time of the composites in a monoethylene glycol (MEG)/water solution at $120^{\circ}C$ had no impact or resulted in slightly decreased mechanical properties such as the tensile strength, tensile modulus, and strain at break in case of POK composites, whereas the mechanical properties of PA66 composites showed a significant drop. Increasing GF concentrations increased the tensile strength, tensile modulus, flexural strength, and flexural modulus of POK composites; however, impact strength did not show significant changes. Hydrolysis mechanisms of POK and PA66 are discussed.

• Proceedings of the KIEE Conference
• /
• 1988.07a
• /
• pp.282-284
• /
• 1988

In this paper, a method for constructing parallel-in, parallel-out multipliers in GF($2^{m}$) is presented. The proposed system is composed of two operational parts by using shift register. One is a multiplicative arithmetical operation part capable of the multiplicative arithmetic and modulo 2 operation to all product terms with the same degree. And the other is an irreducible polynomial operation part to outputs from the multiplicative arithmetical operation part. Since the total hardware is linearly m dependant to an GF($2^{m}$), this system has a reasonable merit when m increases. And also this system is suited for VLSI implementation due to simple, regular, and concurrent properties.

• Proceedings of the Korea Society for Industrial Systems Conference
• /
• 2002.06a
• /
• pp.190-194
• /
• 2002

Multiplication in Galois Field GF(2/sup m/) is a primary operation for many applications, particularly for public key cryptography such as Diffie-Hellman key exchange, ElGamal. The current paper presents a new architecture that can process Montgomery multiplication over GF(2/sup m/) in m clock cycles based on cellular automata. It is possible to implement the modular exponentiation, division, inversion /sup 1)/architecture, etc. efficiently based on the Montgomery multiplication proposed in this paper. Since cellular automata architecture is simple, regular, modular and cascadable, it can be utilized efficiently for the implementation of VLSI.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.28B no.10
• /
• pp.799-806
• /
• 1991

Utilizing dual basis, normal basis, and subfield representation, three different finite field multipliers are presented in this paper. First, we propose an extended dual basis multiplier based on Berlekamp's bit-serial multiplication algorithm. Second, a detailed explanation and design of the Massey-Omura multiplier based on a normal basis representation is described. Third, the multiplication algorithm over GF(($2^{n}$) utilizing subfield is proposed. Especially, three different multipliers are designed over the finite field GF(($2^{4}$) and the complexity of each multiplier is compared with that of others. As a result of comparison, we recognize that the extendd dual basis multiplier requires the smallest number of gates, whereas the subfield multiplier, due to its regularity, simplicity, and modularlity, is easier to implement than the others with respect to higher($m{\ge}8$) order and m/2 subfield order.

• Proceedings of the KIEE Conference
• /
• 2003.11c
• /
• pp.928-931
• /
• 2003

This paper presents a digit-serial/parallel multiplier for finite fields GF(2m). The hardware requirements of the implemented multiplier are less than those of the existing multiplier of the same class, while processing time and area complexity. The implemented multiplier possesses the features of regularity and modularity. Thus, it is well suited to VLSI implementation. If the implemented digit-serial multiplier chooses the digit size D appropriately, it can meet the throughput requirement of a certain application with minimum hardware. The multipliers and squarers analyzed in this paper can be used efficiently for crypto processor in Elliptic Curve Cryptosystem.

• Mycobiology
• /
• v.35 no.3
• /
• pp.145-149
• /
• 2007

The Elfvingia applanata (EA), Hericium erinaceum (HE), Grifola frondosa (GF), Pholiota nameko (PN), Pleurotus eryngii (PE), Trametes suaveolens (TS), Fomes fomentarius (FF), and Inonotus obliquus (IO) could produce the endo- (EN) and exo-biopolymer (EX) in submerged culture. The highest anti-complementary activity of the EN was exhibited by PN (49.1%), followed by HE (38.6%), TS (37.0%), and FF (33.0%), whereas the high activity of the EX was found with GF (59.8%), followed by HE (36.3%), TS (30.8%), and IO (28.8%). The EN of P. nameko (EN-PN) and EX of G. frondosa (EX-GF) were found to contain 78.6% and 41.2% carbohydrates, while 21.4% and 58.8% protein, respectively. The sugar and amino acid compositions of EN-PN and EX-GF were also analyzed in detail.