• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.41 no.12
• /
• pp.1684-1691
• /
• 2016

Erasure codes have recently been applied to distributed storage systems due to their high storage efficiency. Regenerating codes are a kind of erasure codes, which are optimal in terms of minimum repair bandwidth. An (n,k,d)-regenerating code consists of n storage nodes where a failed node can be recovered with the help of the exactly d numbers of surviving nodes. However, if node failures occur frequently or network connection is unstable, the number of helper nodes that a failed node can contact may be smaller than d. In such cases, regenerating codes cannot repair the failed nodes efficiently since the node repair process of the codes does not work when the number of helper nodes is less than d. In this paper, we propose an operating method of regenerating codes where a failed node can be repaired from ${\bar{d}}$ helper nodes where $$k{\leq_-}{\bar{d}}{\leq_-}d$$.

• Journal of information and communication convergence engineering
• /
• v.6 no.2
• /
• pp.213-217
• /
• 2008

This paper proposes a novel method for the recognition of passports based on the CDM(Conditional Dilation Morphology) masking and the ART2-based RBF neural networks. For the extraction of individual codes for recognizing, this paper targets code sequence blocks including individual codes by applying Sobel masking, horizontal smearing and a contour tracking algorithm on the passport image. Individual codes are recovered and extracted from the binarized areas by applying CDM masking and vertical smearing. This paper also proposes an ART2-based hybrid network that adapts the ART2 network for the middle layer. This network is applied to the recognition of individual codes. The experiment results showed that the proposed method has superior in performance in the recognition of passport.

• Journal of Korea Society of Industrial Information Systems
• /
• v.5 no.1
• /
• pp.1-15
• /
• 2000

In this paper, an efficient system for finding answers to a given path algebra expression in a directed acylic graph is discussed more particulary, in a multimedia presentration graph. Path algebra expressions are formulated using revised versions of operators next and until of temporal logic, and the connected operator. To evaluate queries with path algebra expressions, the node code system is proposed. In the node code system, the nodes of a presentation graph are assigned binary codes (node codes) that are used to represent nodes and paths in a presentation graph. Using node codes makes it easy to find parent-child predecessor-sucessor relationships between nodes. A pair of node codes for connected nodes uniquely identifies a path, and allows efficient set-at-a-time evaluations of path algebra expressions. In this paper, the node code representation of nodes and paths in multimedia presentation graphs are provided. The efficient algorithms for the evaluation of queries with path algebra expressions are also provided.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.12A
• /
• pp.1145-1151
• /
• 2010

Hochwald et al. introduced unitary space-time codes for quasi-static Rayleigh fading channels which allows for noncoherent decoding when the channel response is not known at the receiver. However, when reliable information on the channel response is available, coherent decoding is preferable for improved performance. Here, we study the relationship between the performance criteria on the diversity and coding advantages provided by unitary space-time codes with noncoherent and coherent decoding. We show that when a unitary space-time code achieves full spatial diversity with noncoherent decoding, full spatial diversity is also guaranteed with coherent decoding.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.11
• /
• pp.5290-5304
• /
• 2016

With the growth of the massive amount of data, the failure probability of the cloud storage node is becoming more and more big. A single fault tolerance strategy, such as replication and erasure codes, has some unavoidable disadvantages, which can not meet the needs of the today's fault tolerance. Therefore, according to the file access frequency and size, an adaptive hybrid redundant fault tolerance strategy is proposed, which can dynamically change between the replication scheme and erasure codes scheme throughout the lifecycle. The experimental results show that the proposed scheme can not only save the storage space(reduced by 32% compared with replication), but also ensure the fast recovery of the node failures(increased by 42% compared with erasure codes).

• Journal of Communications and Networks
• /
• v.13 no.1
• /
• pp.12-16
• /
• 2011

In this paper, we construct two families $C^*_m$ and ${\~{C}}^*_m$ of ternary ($2^m$, $3^m$, $2^{m-1}$ ) and ($2^m$, $3^{m+1}$, $2^{m-1}$ ) codes, for m = 1, 2, 3, ${\cdots}$, derived from the corresponding families of modified ternary Jacket matrices. These codes are close to the Plotkin bound and have a very easy decoding procedure.

• Proceedings of the IEEK Conference
• /
• 2002.06a
• /
• pp.323-326
• /
• 2002

In this paper, we study the improved bounds on the performance of low-density parity-check (LDPC) codes over binary-input additive white Gaussian noise (AWGN) channels with belief propagation (BP) decoding in log domain. We define an extended Gallager ensemble based on a new method of constructing parity check matrix and make use of this way to improve upper bound of LDPC codes. At the same time, many simulation results are presented in this paper. These results indicate the extended Gallager ensembles based on Hamming codes have typical minimum distance ratio, which is very close to the asymptotic Gilbert Varshamov bound and the superior performance which is better than the original Gallager ensembles.

• Journal of Communications and Networks
• /
• v.18 no.1
• /
• pp.40-49
• /
• 2016

In this paper, we present a symbol-level iterative source-channel decoding (ISCD) algorithm for reliable transmission of variable-length codes (VLCs). Firstly, an improved source a posteriori probability (APP) decoding approach is proposed for packetized variable-length encoded Markov sources. Also proposed is a recursive implementation based on a three-dimensional joint trellis for symbol decoding of binary convolutional codes. APP channel decoding on this joint trellis is realized by modification of the Bahl-Cocke-Jelinek-Raviv algorithm and adaptation to the non-stationary VLC trellis. Simulation results indicate that the proposed ISCD scheme allows to exchange between its constituent decoders the symbol-level extrinsic information and achieves high robustness against channel noises.

• Journal of information and communication convergence engineering
• /
• v.2 no.1
• /
• pp.5-8
• /
• 2004

DS-COMA is now a matured multiple access technology that utilizes spreading codes for user separation. In this paper, we attempt to improve the performance of a multiuser DS-COMA system with a unique chip shaping code called Carrier Interferometry (CI) code. The CI codes exhibit an excellent correlation property that can be used in many applications. In DS-COMA with CI codes (CI/DS-COMA), the symbols are spread by a spreading code and then the chip signals are shaped using a CI code. Due to the correlation property of the CI code, a diversity gain from the shaped chip signals is achieved and the performance of DS-COMA is significantly improved. Comparison study demonstrates that the DS-COMA with CI outperforms the conventional DS-COMA system in multiuser environments.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.7 no.4
• /
• pp.748-766
• /
• 2013

In this paper, we consider an infrastructure-vehicle-vehicle (I2V2V) based Vehicle Ad-hoc Networks (VANETs), where one base station multicasts data to d vehicular users with the assistance of r vehicular users. A Distributed Luby Transform (DLT) codes based transmission scheme is proposed over lossy VANETs to reduce transmission latency. Furthermore, focusing on the degree distribution of DLT codes, a Modified Deconvolved Soliton Distribution (MDSD) is designed to further reduce the transmission latency and improve the transmission reliability. We investigate the network behavior of the transmission scheme with MDSD, called MDLT based scheme. Closed-form expressions of the transmission latency of the proposed schemes are derived. Performance simulation results show that DLT based scheme can reduce transmission latency significantly compared with traditional Automatic Repeat Request (ARQ) and Luby Transform (LT) codes based schemes. In contrast to DLT based scheme, the MDLT based scheme can further reduce transmission latency and improve FER performance substantially, when both the source-to-relay and relay-to-sink channels are erasure channels.