• Bulletin of the Korean Mathematical Society
• /
• v.38 no.4
• /
• pp.797-801
• /
• 2001

The purpose of this paper is to give an upper bound for A[n,4], the maximum number of codewords in a binary code of word length n with minimum distance 4 between codewords. We have improved upper bound for A[12k+11,4]. In this correspondence we prove $A[23,4]\leq173716$.

• Bulletin of the Korean Mathematical Society
• /
• v.56 no.1
• /
• pp.111-130
• /
• 2019

The concepts of pseudocodeword and pseudoweight play a fundamental role in the finite-length analysis of LDPC codes. The pseudoredundancy of a binary linear code is defined as the minimum number of rows in a parity-check matrix such that the corresponding minimum pseudoweight equals its minimum Hamming distance. By using the value assignment of Chen and Kløve we present new results on the pseudocodeword redundancy of binary linear codes. In particular, we give several upper bounds on the pseudoredundancies of certain codes with repeated and added coordinates and of certain shortened subcodes. We also investigate several kinds of k-dimensional binary codes and compute their exact pseudocodeword redundancy.

• Bulletin of the Korean Mathematical Society
• /
• v.56 no.2
• /
• pp.285-301
• /
• 2019

Let $p_1$ and $p_2$ be two distinct odd primes with gcd($p_1-1$, $p_2-1$) = 6. In this paper, we compute the linear complexity of the first class two-prime Whiteman's generalized cyclotomic sequence (WGCS-I) of order d = 6. Our results show that their linear complexity is quite good. So, the sequence can be used in many domains such as cryptography and coding theory. This article enrich a method to construct several classes of cyclic codes over GF(q) with length $n=p_1p_2$ using the two-prime WGCS-I of order 6. We also obtain the lower bounds on the minimum distance of these cyclic codes.

• ETRI Journal
• /
• v.32 no.6
• /
• pp.972-975
• /
• 2010

In this letter, we consider the lossy coding of a non-uniform binary source based on GF(q)-quantized low-density generator matrix (LDGM) codes with check degree $d_c$=2. By quantizing the GF(q) LDGM codeword, a non-uniform binary codeword can be obtained, which is suitable for direct quantization of the non-uniform binary source. Encoding is performed by reinforced belief propagation, a variant of belief propagation. Simulation results show that the performance of our method is quite close to the theoretic rate-distortion bounds. For example, when the GF(16)-LDGM code with a rate of 0.4 and block-length of 1,500 is used to compress the non-uniform binary source with probability of 1 being 0.23, the distortion is 0.091, which is very close to the optimal theoretical value of 0.074.

• 한국방재학회:학술대회논문집
• /
• 2007.02a
• /
• pp.303-306
• /
• 2007

CWR(Continuous Welded Rail) and bridge interaction produce rail force, bridge displacement and rail/bridge relative displacement. Each of these has limitation by many codes. In this paper, analysis of interaction has been carried out by using foreign codes(UIC 774-3 R code of Europe etc.) because there is no code about interaction between rail and bridge in Korea. Recently, railway bridges with CWR has been constructed for structural and economical reasons. When designer plans railway bridges, design a bridge model first and then investigate railway forces and displacement by interaction analysis. If these results go out bounds from limitation, designer plans railway bridges again and again. In this paper, using the parametric study on CWR and railway bridge interaction, railway bridge parameters such as length of bridge span, area of bridge, moment of inertia, stiffness of pier, etc. are presented. It helps preliminary design of railway bridges.

• Proceedings of the KSR Conference
• /
• 2007.05a
• /
• pp.1460-1465
• /
• 2007

CWR(Continuous Welded Rail) and bridge interaction produce rail force, bridge displacement and rail/bridge relative displacement. Each of these has limitation by many codes. In this paper, analysis of interaction has been carried out by using foreign codes(UIC 774-3 R code of Europe etc.) because there is no code about interaction between rail and bridge in Korea. Recently, railway bridges with CWR has been constructed for structural and economical reasons. When designer plans railway bridges, design a bridge model first and then investigate railway forces and displacement by interaction analysis. If these results go out bounds from limitation, designer plans railway bridges again and again. In this paper, using the parametric study on CWR and railway bridge interaction, railway bridge parameters such as length of bridge span, area of bridge, moment of inertia, stiffness of pier, etc. are presented. It helps preliminary design of railway bridges.

• Proceedings of the Computational Structural Engineering Institute Conference
• /
• 2007.04a
• /
• pp.445-450
• /
• 2007

CWR(Continuous Welded Rail) and bridge interaction produce rail force, bridge displacement and rail/bridge relative displacement. Each of these has limitation by many codes. In this paper, analysis of interaction has been carried out by using foreign codes(UIC 774-3 R code of Europe etc.) because there is no code about interaction between rail and bridge in Korea. Recently, railway bridges with CWR has been constructed for structural and economical reasons. When designer plans railway bridges, design a bridge model first and then investigate railway forces and displacement by interaction analysis. If these results go out bounds from limitation, designer plans railway bridges again and again. In this paper, using the parametric study on CWR and railway bridge interaction, railway bridge parameters such as length of bridge span, area of bridge, moment of inertia, stiffness of pier, etc. are presented. It helps preliminary design of railway bridges.

• Journal of applied mathematics & informatics
• /
• v.8 no.3
• /
• pp.773-793
• /
• 2001

The explicit expressions for the 2n+1 primitive idempotents in R/sub pⁿ/ = F[x]/< x/sup pⁿ/ -1>, where F is the field of prime power order q and the multiplicative order of q modulo pⁿ is ø(pⁿ)/2(n≥1 and p is an odd prime), are obtained. An algorithm for computing the generating polynomials of the minimal QR cyclic codes of length pⁿ, generated by these primitive idempotents, is given and hence some bounds on the minimum distance of some QR codes of prime length over GF(q)(q=2, 3, ...) are obtained.

• Journal of Communications and Networks
• /
• v.7 no.3
• /
• pp.307-312
• /
• 2005

In this work, we study the performance of a serial concatenated scheme comprising a convolutional code (CC) and an orthogonal space-time block code (STBC) separated by an inter-leaver. Specifically, we derive performance bounds for this concatenated scheme, clearly quantify the impact of using a CC in conjunction with a STBC, and compare that to using a STBC code only. Furthermore, we examine the impact of performing antenna selection at the receiver on the diversity order and coding gain of the system. In performing antenna selection, we adopt a selection criterion that is based on maximizing the instantaneous signal-to­noise ratio (SNR) at the receiver. That is, we select a subset of the available receive antennas that maximizes the received SNR. Two channel models are considered in this study: Fast fading and quasi-static fading. For both cases, our analyses show that substantial coding gains can be achieved, which is confirmed through Monte-Carlo simulations. We demonstrate that the spatial diversity is maintained for all cases, whereas the coding gain deteriorates by no more than $10\;log_{10}$ (M / L) dB, all relative to the full complexity multiple-input multiple-output (MIMO) system.

• Journal of KIISE:Software and Applications
• /
• v.32 no.12
• /
• pp.1283-1291
• /
• 2005

One of the problems in boosting Java performance using a Just-in-Time (JIT) compiler is removing redundant array bound checks. In conventional static compilers, many powerful algorithms have been developed, yet they are not directly applicable to JIT compilation where the compilation time is part of the whole running time. In the current JIT compilers, we tan use either a naive algorithm that is not powerful enough or an aggressive algorithm which requires the transformation into a static single assignment (SSA) form of programs (and back to the original form after optimization), thus causing too much overhead not appropriate for JIT compilation This paper proposes a new algorithm based on an inequality graph which can eliminate array bounds check codes aggressively without resorting to the SSA form. When we actually perform this type of optimization, there are many constraints in code motion caused by the precise exception rule in Java specification, which would cause the algorithm to miss many opportunities for eliminating away bound checks. We also propose a new method to overcome these constraints.