• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.19 no.3
• /
• pp.418-424
• /
• 1994

Like the Hermitian function field over GF(q), those subfields defined by y +y=x where s divides q+1 are also maximal, having the maximum number os places of degree one permissible by the Hasse-Weil bound. Geometric Goppa codes(or algebraic geometric codes) arising from these subfields of the Hermitian function field are studied in this paper. Their dimension and minimum distance are explicilty and completely presented for any m with m

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2003.11a
• /
• pp.133-138
• /
• 2003

가변길이 부호는 정보원(source)의 통계적인 특성을 이용하여 부호화 효율을 높이지만. 잡음이 심한 전송환경에선 비트에 대한 오류가 발생하면 심각하게 손상되는 단점을 가진다. 이러한 가변길이 부호의 문제를 해결하기 위해 양방향 가변길이 부호가 제안되었다. 양방향 가변길이 부호는 순방향과 역방향으로 복호가 가능하여 전송 오류로 인해 손상된 비디오 비트열에서 데이터를 복구할 수 있다. 부호의 자유거리(free distance)는 부호자체가 전송 오류에 얼마나 강인한지를 보여주는 척도로 사용된다. 양방향 가변길이 부호의 자유거리(free distance)의 최소 값은 1이므로 비디오 비트열 손상 자체를 방지할 수는 없다 본 논문에서는 자유거리(free distancs)의 최소 값을 증가시켜 전송오류에 더욱 강인한 새로운 양방향 가변길이 부호의 선계 기법을 제안한다. 제안된 알고리즘은 주어진 Huffman 부호와 평균부호길이 함수의 특성을 이용하여 자유거리의 조건을 만족하면서 동시에 부호화 효율을 높여 기존의 알고리즘보다 향상된 성능을 보여준다.

• Proceedings of the Computational Structural Engineering Institute Conference
• /
• 2011.04a
• /
• pp.565-568
• /
• 2011

NURBS는 매개변수를 이용하여 3차원에서 곡면을 표현한 방법으로서 노트벡터, 조정점, 가중치로 구성된다. 레벨셋은 공간을 음함수로 정의된 장으로 형성하여 음함수의 일정한 값을 추적하여 곡면을 표현한 방법이다. 본 논문에서는 스캔 데이터를 NURBS 형태로 추출한 뒤 이를 정밀한 레벨셋 모델로 변환하였다. 레벨셋 모델을 구성하기 위해서 형성된 음함수는 부호를 갖는 거리함수를 사용하였고, 거리함수를 정밀하게 나타내기 위해 Newton 순환법을 이용하였다. 변환된 레벨셋 모델을 이용하여 형상의 몰핑을 수행하였다. 몰핑은 초기 형상을 목표 형상으로 변화시켜 나가는 과정으로서 레벨셋 모델을 이용한 몰핑은 용이성과 질적인 측면에서 우수하다. 수치 예제에서는 스캔 데이터의 레벨셋 모델 변환과 변환된 형상이 자연스럽게 목표형상으로 변화하는지를 확인한다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.25 no.10A
• /
• pp.1576-1581
• /
• 2000

We investigated into the minimum distance of a primitive binary cyclic code C with a generator polynomial g(x)=$m_1(x)m_{d}(x)$. It is known that the necessary and sufficient condition for C to have minimum distance five is the fact that \ulcorner is an APN power function. In this paper we derived the new proof of minimum distance for the primitive binary cyclic codes with minimum distance five.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.6 no.2
• /
• pp.159-164
• /
• 2005

When an optical pulse propagates through the atmospheric channel, the atmospheric turbulence attenuates and spreads this pulse. This attenuation and broadening of pulse are occurred by the fluctuation in the arrival time of pulse at the optical receiver. This pulse broadening induces the intersymbol interference (ISI) between the adjacent pulses. finally, the adjacent pulses are overlapped and the bit rate and the repeaterless transmission length are limited by the ISI. In digital communication system, therefore, the pulse broadening is more important factor than the attenuation. In this paper, thus, we find the ISI in the atmospheric turbulence as the function of the structure constant for the refractive index fluctuation that presents the strength of turbulence using the temporal momentum function and present it by numerical analysis.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2012.11a
• /
• pp.101-102
• /
• 2012

지수-골롬 부호는 데이터의 무손실 부호화를 위해 사용되는 대표적인 방법으로서 지수 함수 형태로 단일 모드 분포를 가지는 데이터의 부호화에 적합하다. 본 논문에서는 데이터의 분포가 단일 모드가 아닌 이중 모드를 가지는 경우에 적용하기 위해 변형된 지수-골롬 부호를 제안하고 모드의 높이와 모드 사이의 거리에 따른 부호화 성능을 살펴보았으며 실제 데이터에 적용한 실험결과를 제시하였다.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.43 no.8 s.350
• /
• pp.59-68
• /
• 2006

The study on the uniform error property of codes has been restricted to additive white Gaussian noise (AWGN) channel, which is generally referred to as geometrical uniformity. In this paper, we extend the uniform error property to space-time codes in multiple-input multiple-output (MIMO) channel by directly treating the probability density functions fully describing the transmission channel and the receiver. Moreover, we provide the code construction procedure for the geometrically uniform space-time trellis codes in fast MIMO channels, which consider the distance spectrum. Due to the uniform error property, the complexity of code search is extensively reduced. Such reduction makes it possible to obtain the optimal space-time trellis codes with high order states. Simulation results show that new codes offer a better performance in fast MIMO channels than other known codes.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.13 no.12
• /
• pp.2677-2684
• /
• 2009

In this paper, we study a watermarking method based on the informed coding and embedding by means of trellis code and entropy masking. An image is divided as $8{\times}8$ block with no overlapping and the discrete cosine transform(DCT) is applied to each block. Then the 16 medium-frequency AC terms of each block are extracted. Next it is compared with gaussian random vectors having zero mean and unit variance. As these processing, the embedding vectors with minimum value of linear combination between linear correlation and Watson distance can be obtained by Viterbi algorithm at each stage of trellis coding. For considering the image characteristics, we apply different weight value between the linear correlation and the Watson distance using the entropy masking. To evaluate the performance of proposed method, the average bit error rate of watermark message is calculated from different several images. By the experiments the proposed method is improved in terms of the average bit error rate.

• Proceedings of the SAREK Conference
• /
• 2006.06a
• /
• pp.116-121
• /
• 2006

Numerical simulations for dendritic growth of crystals are conducted in this study by the level set method. The effect of order of difference is tested for reinitialization error in simple problems and authors founded in case of 1st order of difference that very fine grids have to be used to minimize the error and higher order of difference is desirable to minimize the reinitialization error The 2nd and 4th order Runge-Kutta scheme in time and 3rd and 5th order of WENO schemes with Godunov scheme are applied for space discretization. Numerical results are compared with the analytical theory, phase-field method and other researcher's level set method.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.38A no.6
• /
• pp.459-464
• /
• 2013

In this paper, we introduce a modulation code design problem where best selection of two-dimensional codewords are determined to reduce two-dimensional (2D) intersymbol interference (ISI) and interpage interference (IPI). Codeword selection problem is formulated as a quadratic integer programming model that minimizes intra- and inter-symbol differences subject to uniform symbol usage and minimal Hamming distance violations. Second integer programming model detects the occurrence of isolated pixel pattern in the selected codewords. The proposed models are applied to 4-level and 2-level 6/8 codes.