• The Korean Journal of Mycology
• /
• v.40 no.2
• /
• pp.73-77
• /
• 2012

Nomenclatural code for fungi was dramatically modified in the 18th International Botanical Congress (IBC) held in Melbourne, Australia in July 2011. Its name was changed into International Code of Nomenclature for Algae, Fungi and Plants (ICN), which was formerly called as International Code of Botanical Nomenclature (ICBN) of the Vienna Code of 2005. The most important change for fungi is abandoning dual nomenclature and introducing one fungus/one name system (2013. 1). Since more than 10,000 species of fungal names should be renamed based on this new classification system (one fungus/one name system), it is challenging to both mycologists and taxonomic users such as plant pathologists and food scientists. Here, we introduced background, progress and future plan for its transition into one fungus/one name system. The new code is allowing electronic-only publication of names of new taxa (2102. 1) and the requirement for a Latin validating diagnosis was changed to allow either English or Latin for the publication of a new name (2011. 1). Furthermore, pre-publication deposit of key nomenclatural information in a recognized repository is mandatory in ICN (2013. 1). The aims of this manuscript are to introduce new code of fungal nomenclature and recent trends in one fungus/one name system to Korean mycological society.

• ETRI Journal
• /
• v.38 no.5
• /
• pp.896-902
• /
• 2016

Luby transform (LT) codes were the first practical rateless erasure codes proposed in the literature. The performances of these codes, which are iteratively decoded using belief propagation algorithms, depend on the degree distribution used to generate the coded symbols. The existence of degree-one coded symbols is essential for the starting and continuation of the decoding process. The absence of a degree-one coded symbol at any instant of an iterative decoding operation results in decoding failure. To alleviate this problem, we proposed a method used in the absence of a degree-one code symbol to overcome a stuck decoding operation and its continuation. The simulation results show that the proposed approach provides a better performance than a conventional LT code and memory-based robust soliton distributed LT code, as well as that of a Gaussian elimination assisted LT code, particularly for short data lengths.

• Journal of applied mathematics & informatics
• /
• v.5 no.1
• /
• pp.201-212
• /
• 1998

In the present paper we define the codes which assign D-alphabet one-one codeword to each outcome of a random variable and the functions which represent possible transormations from one-one codes of size D to suitable codes. By using these functions we obtain lower bounds on the exponentiated mean codeword length for one-one codes in terms of the generalized entropy of order $\alpha$ and type $\beta$ and study the particular cases also.

• Proceedings of the Korea Society of Information Technology Applications Conference
• /
• 2005.11a
• /
• pp.69-72
• /
• 2005

As life style becomes to be complicated, lots of support technologies were developed. The bar code technology is one of them. It was renovating approach to goods industry. However, data storage ability in one dimension bar code came in limit because of industry growth. Two-dimension bar code was proposed to overcome one-dimension bar code. PDF417 bar code most commonly used in standard two-dimension bar codes is well defined at data decoding and error correction area. More works could be done in bar code image acquisition process. Applying various image enhancement algorithms, the recognition rate of PDF417 bar code is improved.

• Journal of Korea Society of Digital Industry and Information Management
• /
• v.4 no.1
• /
• pp.17-24
• /
• 2008

This paper describes the measurements that provide a characterization of the code-domain channels of a CDMA base station transmitter. One of the measurements, called code-domain power(CDP), provides the distribution of power in the code domain channels. This measurement can be used to verify that the various channels are at expected power levels and to determine when one code channel is leaking energy into the other code channels. We develop module of CDP measurement in the CDMA system.

• ETRI Journal
• /
• v.25 no.2
• /
• pp.144-147
• /
• 2003

We propose a new serial concatenation scheme for space-time and recursive convolutional codes, in which a space-time code is used as the outer code and a single recursive convolutional code as the inner code. We discuss previously proposed serial concatenation schemes employing multiple inner codes and compare them with the new one. The proposed method and the previous one with joint decoding, both performing a combined decoding of the simultaneous output signals from multiple antennas, give a large performance gain over the separate decoding method. In decoding complexity, the new concatenation scheme has a lower complexity compared with the multiple encoding/joint decoding scheme due to the use of the single inner code. Simulation results for a communication system with two transmit and one receive antennas in a quasi-static Rayleigh fading channel show that the proposed scheme outperforms the previous schemes.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.3 no.4
• /
• pp.737-745
• /
• 1999

In this paper, we present encoders and decoders with the two kinds of ternary Bose-Chaudhuri-Hocquenghem(BCH) codes in the most basic ternary code system from among multiple-valued code systems. One is the random-triple-error-correcting ternary BCH(26,14) code for sequential data, the other is random-triple -error-correcting ternary BCH (26,13) code. The encoders and the decoders realized are verified by experiment. Amount of the (26,13) decoder's hardware is about 50% of the one of the (26,14) decoder's one.

• ETRI Journal
• /
• v.28 no.2
• /
• pp.235-238
• /
• 2006

In this letter, a block code that minimizes the peak-to-average power ratio (PAPR) of orthogonal frequency division multiplexing (OFDM) signals is proposed. It is shown that peak envelope power is invariant to cyclic shift and codeword inversion. The systematic encoding rule for the proposed code is composed of searching for a seed codeword, shifting the register elements, and determining codeword inversion. This eliminates the look-up table for one-to-one correspondence between the source and the coded data. Computer simulation confirms that OFDM systems with the proposed code always have the minimum PAPR.

• Nuclear Engineering and Technology
• /
• v.41 no.7
• /
• pp.953-968
• /
• 2009

It is important to accurately predict the temperature and density distributions in large stratified enclosures both for design optimization and accident analysis. Current reactor system analysis codes only provide lumped-volume based models that can give very approximate results. Previous scaling analysis has shown that stratified mixing processes in large stably stratified enclosures can be described using one-dimensional differential equations, with the vertical transport by jets modeled using integral techniques. This allows very large reductions in computational effort compared to three-dimensional CFD simulation. The BMIX++ (Berkeley mechanistic MIXing code in C++) code was developed to implement such ideas. This paper summarizes major models for the BMIX++ code, presents the two-plume mixing experiment simulation as one validation example, and describes the codes' application to the liquid salt buffer pool system in the AHTR (Advanced High Temperature Reactor) design. Three design options have been simulated and they exhibit significantly different stratification patterns. One of design options shows the mildest thermal stratification and is identified as the best design option. This application shows that the BMIX++ code has capability to provide the reactor designers with insights to understand complex mixing behavior with mechanistic methods. Similar analysis is possible for liquid-metal cooled reactors.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.39C no.12
• /
• pp.1323-1326
• /
• 2014

In this letter, we compare the performance of two concatenated coding structures in slow FH/SS systems for multimedia/multicast transmission on shipboard. Two outer code symbols are transmitted during a hop. The first structure consists of one inner codeword per one outer code symbol, while the second structure consists of one inner codeword per two outer code symbols. We analyze the overall block error probability in asymptotic region and show that the performance of the second scheme is superior to the first one.