• 대한수학회논문집
• /
• 제11권3호
• /
• pp.575-584
• /
• 1996

We investigate how the code automorphism groups can be used to study such combinatorial objects as codes, finite projective planes and Hadamard matrices. For this purpose, we write down a computer program for computing code automorphisms in PASCAL language. Then we study the combinatorial properties using those code automorphism group algorithms and the relationship between combinatorial objects and codes.

• 대한수학회보
• /
• 제54권4호
• /
• pp.1095-1110
• /
• 2017

The t-wise intersection is a useful property of a linear code due to its many applications. Recently, the second author determined the t-wise intersection of a relative two-weight code. By using this result and generalizing the finite projective geometry method, we will present the t-wise intersection of a relative three-weight code and its applications in this paper.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2001년도 하계종합학술대회 논문집(2)
• /
• pp.297-300
• /
• 2001

Turbo code shows the great performance near Shannon limit on AWGN channel. Mainly, turbo code has been studied and designed for wireless digital communications. There are recent studies that applies turbo decoder on magnetic recording. Because of the limited capacity of magnetic storages, high rate turbo code is used for magnetic storages. This paper presents some issues on implementing high rate turbo code and structures for designing turbo decoder

• Korean Journal of Mathematics
• /
• 제20권4호
• /
• pp.525-532
• /
• 2012

We study the extended quadratic residue code of length 24 over $\mathbb{Z}_3$ and its lifts to rings $\mathbb{Z}_{3^e}$ for all e including 3-adic integers ring. We completely determine the weight enumerators of all these lifts.

• 정보저장시스템학회논문집
• /
• 제6권2호
• /
• pp.47-51
• /
• 2010

We investigate misalignment characteristics of 5/8 modulation code for holographic data storage. The 5/8 modulation code does not have any isolated patterns that is the most unwanted problem for holographic data storage. As the results, the 5/8 modulation code showed a strong side of misalignments, and the code has the best performance among uncoded, 5/9, and 6/8 modulation codes when there are large misalignments.

• KIEAE Journal
• /
• 제11권4호
• /
• pp.79-85
• /
• 2011

Landscaping on building sites has been regulated by Building Code in Korea. By Article 42 of the Code, landscaping is mandated in the process of building construction and people should comply with the code to get the building permit. On the other hand, sustainability tends to be a prime value these days. Because of the intrinsic nature of Korea Building Code, the landscaping was not adequately implemented in reality. After studies on the landscape ordinance, the major problems on the mandated landscaping has been speculated as follows: 1. As far as landscaping has been regulated by single building code, there seems to be a limitation. Urban Planning Code etc. would be another mean to adequate landscaping. 2. Speculations on landscape details associated with landscape plans are needed for building permit process. 3. By any level of law, the landscape should be reinforced for public buildings and developments because of its own publicity. 4. Locally sound landscape would be implemented through Special Architectural District etc.

• 대한산업공학회지
• /
• 제23권4호
• /
• pp.741-754
• /
• 1997

Code matrix is the matrix of which on element and its neighbors are arranged to have a code value. The code matrix was originally designed by the author for developing a vision system but has not been theoretically studied. In this paper some theoretical properties of the code matrix are investigated. The studied characteristics of the code matrix are useful for not only understanding the matrix itself but efficiently restructuring the matrix. A number of transformation functions, which enable the matrix to have different shape, are thus developed based on the investigated properties. The transformation functions are then applied to build a perfectly and uniformly structured square code matrix, which is proven useful in on image processing example. The study in this paper is expected to serve a theoretical background for the application of the code matrix in many areas.

• 대한전자공학회논문지SD
• /
• 제43권7호
• /
• pp.7-12
• /
• 2006

광 기록 채널을 위한 간단한 6-ary(3, 10) runlength-limited(RLL) code를 연구하였다. 이 제안하는 코드는 6개의 state로 나타낼 수 있어 look-up table의 크기를 작게 할 수 있다. 또한 coding density가 $3.33bits/T_{min}$ 이며 96.6%의 code efficiency를 나타내었다.

• 한국컴퓨터산업학회논문지
• /
• 제5권9호
• /
• pp.1079-1088
• /
• 2004

일반적으로 코드 모션 알고리즘은 계산적 최적화와 레지스터 과부하와 연관되는 실행시간 최적화를 수행 한다. 본 논문은 계산적 최적화와 수명적 최적화에 더하여 코드의 크기를 고려하는 희소 코드 모션 알고리즘을 제안한다. 희소 코드 모션 알고리즘에서 BCM 알고리즘은 계산적으로 최적 코드 모션을 수행하고, LCM 알고리즘은 레지스터 과부하를 감소시킨다. 희소 코드 모션 알고리즘은 블필요한 코드 모션을 억제시키기 때문에 계산적으로나 수명적으로 최적인 알고리즘이다. 희소 코드 모션 알고리즘은 성능평가를 통하여 기존의 연구보다 프로그램의 능률 및 실행시간을 향상시켰다.

• 한국정보통신학회논문지
• /
• 제5권6호
• /
• pp.1184-1189
• /
• 2001

본 논문에서는 참고문헌 11에서 제안한 세미랜덤 인터리버를 사용한 터보코드의 성능을 분석하였다. 그리고 현재 이동통신시스템에서 사용하고 있는 길쌈부호의 비터비 복호 알고리즘과 구속장이 일정할 때 두 부호의 복호 성능을 비교 분석하였다. 그 결과 길쌈부호와 터보코드가 BER = $10^{-4}$ , 구속 장이 5일 때 세미랜덤 인터리버를 사용한 터보코드가 길쌈부호보다 약 $E_{b/}$ $N_{o}$ =4.7[㏈] 우수함을 입증하였다.다.