• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.7
• /
• pp.3583-3598
• /
• 2019

In order to improve the reliability and repair efficiency of distributed storage systems, minimum bandwidth regenerating (MBR) codes based on cyclic variable fractional repetition (VFR) codes are constructed in this thesis, which can repair failed nodes accurately. Specifically, in order to consider the imbalance of data accessed by the users, cyclic VFR codes are constructed according to that data with different heat degrees are copied in different repetition degrees. Moreover, we divide the storage nodes into groups, and construct MBR codes based on cyclic VFR codes to improve the file download speed. Performance analysis and simulation results show that, the repair locality of a single node failure is always 2 when MBR codes based on cyclic VFR codes are adopted in distributed storage systems, which is obviously superior to the traditional MBR codes. Compared with RS codes and simple regenerating codes, the proposed MBR codes based on cyclic VFR codes have lower repair locality, repair complexity and bandwidth overhead, as well as higher repair efficiency. Moreover, relative to FR codes, the MBR codes based on cyclic VFR codes can be applicable to more storage systems.

• Korean Journal of Mathematics
• /
• v.28 no.2
• /
• pp.285-294
• /
• 2020

We study the complementary information set codes (for short, CIS codes) over 𝔽₄. They are strongly connected to correlation-immune functions over 𝔽₄. Also the class of CIS codes includes the self-dual codes. We find a construction method of CIS codes over 𝔽₄ and a criterion for checking equivalence of CIS codes over 𝔽₄. We complete the classification of all inequivalent CIS codes of length up to 8 over 𝔽₄.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2004.05a
• /
• pp.32-35
• /
• 2004

In this paper, we propose two novel high-rate high-performance space-time codes for multiple-input multiple-output (MIMO) systems. When $n_{T}$ transmit antennas and $n_{R}$ = $n_{T}$ receive antennas are deployed, the two proposed codes respectively offer transmission rates of ( $n_{T}$ -I) and ( $n_{T}$ - 2) symbols per channel use and diversity orders of 3 and 5. As a consequence, our proposed codes allow the MIMO systems to employ a simple detection technique based on QR decomposition. Moreover, for equal or even higher spectral efficiencies, our proposed codes always provide much better bit error rate (BER) performances than V-BLAST architecture does when $n_{R}$ = $n_{T}$. Computer simulation is given to verify performances of our proposed codes.sed codes.des.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.17 no.4
• /
• pp.1182-1199
• /
• 2023

Fractional repetition (FR) codes can achieve exact uncoded repair for multiple failed nodes, with lower computational complexity and bandwidth overhead, and effectively improve repair performance in distributed storage systems (DSS). The actual distributed storage system is dynamic, that is, the parameters such as node storage overhead and number of storage nodes will change randomly and dynamically. Considering that traditional FR codes cannot be flexibly applied to dynamic distributed storage systems, a new construction scheme of adaptive-and-resolvable FR codes based on hypergraph coloring is proposed in this paper. Specifically, the linear uniform regular hypergraph can be constructed based on the heuristic algorithm of hypergraph coloring proposed in this paper. Then edges and vertices in hypergraph correspond to nodes and coded packets of FR codes respectively, further, FR codes is constructed. According to hypergraph coloring, the FR codes can achieve rapid repair for multiple failed nodes. Further, FR codes based on hypergraph coloring can be generalized to heterogeneous distributed storage systems. Compared with Reed-Solomon (RS) codes, simple regenerating codes (SRC) and locally repairable codes (LRC), adaptive-and-resolvable FR codes have significant advantages over repair locality, repair bandwidth overhead, computational complexity and time overhead during repairing failed nodes.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2022.05a
• /
• pp.365-366
• /
• 2022

The distributed code is a type of linear codes that can be used for coding and federated learning for privacy. In the distributed code, privacy or confidential information is not dependent to each other because the information of each code is not included with other codes. In this paper, we examine the properties of these distributed codes and present techniques for synthesizing new sets of distributed codes from previously known distributed codes. In addition, we propose several scenarios in which combined codes can be used.

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

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.26 no.8A
• /
• pp.1437-1440
• /
• 2001

We present a modification method for runlength limited codes based on convolutional codes. This method is based on cosets of convolutional codes and can be applied to any convolutional code without degradation of error control performance of the codes. The upper bound of maximum zero and/or one runlength are provided. Some convolutional codes which have the shortest maximum runlength for given coding parameters are tabulated.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.3C
• /
• pp.205-215
• /
• 2007

This paper presents low latency and/or computation algorithms of iterative codes of turbo codes, turbo product codes and low density parity check codes for use in wireless broadband communication systems. Due to high coding complexity of iterative codes, this paper focus on lower complexity and/or latency algorithms that are easily implementable in hardware and further accelerate the decoding speed.

• Proceedings of the IEEK Conference
• /
• 2002.07c
• /
• pp.1705-1708
• /
• 2002

Spreading codes with ZCD(zero-correlation duration) property have the MAI(multiple access interference) rejection ability in the CDMA systems. A class of multi-level spreading codes, i.e., Zero padded ternary ZCD codes are introduced in this paper. By the selected zero-padding method to the binary ZCD codes, ternary ZCD codes are generated and they have enhanced ZCD property and family size than the binary ZCD codes.

• Journal of Information Processing Systems
• /
• v.10 no.1
• /
• pp.69-80
• /
• 2014

The free distance of (n, k, l) convolutional codes has some connection with the memory length, which depends on not only l but also on k. To efficiently obtain a large memory length, we have constructed a new class of (2k, k, l) convolutional codes by (2k, k) block codes and (2, 1, l) convolutional codes, and its encoder and generation function are also given in this paper. With the help of some matrix modules, we designed a single structure Viterbi decoder with a parallel capability, obtained a unified and efficient decoding model for (2k, k, l) convolutional codes, and then give a description of the decoding process in detail. By observing the survivor path memory in a matrix viewer, and testing the role of the max module, we implemented a simulation with (2k, k, l) convolutional codes. The results show that many of them are better than conventional (2, 1, l) convolutional codes.