• Journal of applied mathematics & informatics
• /
• 제28권1_2호
• /
• pp.283-293
• /
• 2010

In this paper, inverse constrained minimum spanning tree problem under Hamming distance. Such an inverse problem is to modify the weights with bound constrains so that a given feasible solution becomes an optimal solution, and the deviation of the weights, measured by the weighted Hamming distance, is minimum. We present a strongly polynomial time algorithm to solve the inverse constrained minimum spanning tree problem under Hamming distance.

• 전자공학회논문지
• /
• 제50권7호
• /
• pp.175-180
• /
• 2013

본 논문에서는 멀티미디어 콘텐츠의 부정자를 추적하기 위하여, 공모된 핑거프린팅 코드를 해밍거리를 이용하여 XOR 공모공격을 분류하는 알고리즘을 제안한다. 기존의 공모된 핑거프린팅 코드는 상관관계수를 이용하여 부정자를 판정하였지만 제안된 방법은 해밍거리를 이용하였다. 그 결과 상관관계 계수에 의한 XOR 공모공격은 XOR의 심각한 선형문제 때문에 50% 정도의 공모자 수에서 불가능 했던 부정자 추적이 해밍거리를 이용하여 최소한 1명의 부정자를 추적할 수 있는 추적도의 성능을 향상시켰으므로, 제안된 부정자 추적의 기능동작은 Probabilistic Scheme에 부합하였다.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 1998년도 하계종합학술대회논문집
• /
• pp.807-810
• /
• 1998

This paper presents BIST (Built-in self-test) techniques for detection of path delay faults in digital circuits. In the proosed BIST schemes, the shift registers make possible to concurrently generate and compact the latched test data. Therefore the test time is reduced efficiently. By reordering the elements of th shifte register based on the information of the hamming distance of each memory elements in CUt, it is possible to increase the number of path delay faults detected robustly/non-robustly. Experimental results for ISCAS'89 benchmark circuits show the efficiency of the proposed BIST techniques.

• 산업경영시스템학회지
• /
• 제27권4호
• /
• pp.94-104
• /
• 2004

This paper proposed a new method to evaluate service quality attribute of perceived service quality in public sectors, using triangle fuzzy numbers and hamming distance. Our method measured the ratio of the expected and perceived service for the customers' perceived service quality. By using fuzzy numbers, This method not only overcomes linguistic variable problems but also provides more objective and direct information for service quality attributes. The discrepancy rate between expected service and perceived service that is perceived service quality is evaluated by hamming distance. To evaluate the discrepancy rate from hamming distance, we induced general solutions to compute the intersection area between two triangle fuzzy numbers and the weak or strong attributes in public sectors are clarified.

• ETRI Journal
• /
• 제43권4호
• /
• pp.746-757
• /
• 2021

Side-channel attacks pose an inevitable challenge to the implementation of cryptographic algorithms, and it is important to mitigate them. This work identifies a novel data encoding technique based on 1-of-4 codes to resist differential power analysis attacks, which is the most investigated category of side-channel attacks. The four code words of the 1-of-4 codes, namely (0001, 0010, 1000, and 0100), are split into two sets: set-0 and set-1. Using a select signal, the data processed in hardware is switched between the two encoding sets alternately such that the Hamming weight and Hamming distance are equalized. As a case study, the proposed technique is validated for the NIST standard AES-128 cipher. The proposed technique resists differential power analysis performed using statistical methods, namely correlation, mutual information, difference of means, and Welch's t-test based on the Hamming weight and distance models. The experimental results show that the proposed countermeasure has an area overhead of 2.3× with no performance degradation comparatively.

• 한국통신학회논문지
• /
• 제29권5C호
• /
• pp.611-617
• /
• 2004

The optimum convolutional error correction codes for recently standardized Feher-patented quadrature phase-shift keying (FQPSK-B) modulation are proposed. We utilize the continuous phase modulation characteristics of FQPSK-B signals for calculating the minimum Euclidean distance of convolutional coded FQPSK-B signal. It is shown that the Euclidean distance between two FQPSK-B signals is proportional to the Hamming distance between two binary data sequence. Utilizing this characteristic, we show that the convolutional codes with optimum free Hamming distance is the optimum convolutional codes for FQPSK-B signals.

• Journal of applied mathematics & informatics
• /
• 제5권1호
• /
• pp.99-110
• /
• 1998

In this paper we study cyclic codes in $Z_m$. i.e., ideals in $Z_mG$, G afinite abelian group and we give a classification of such codes. We also sgtudy the minimum Hamming distance and the generalized Hamming weight of BCH codes over $Z_m$.

• 한국통신학회논문지
• /
• 제19권5호
• /
• pp.912-919
• /
• 1994

본 논문에서는 확대 Hamming 부호를 이용한 새로운 오류제어선로부호를 제안하고 그 성능을 분석한다. 제안된 부호는 최소 Hamming 거리가 4이므로 기본적으로 한개의 오류를 정정할 수 있고 두개의 오류를 검출한 수 있다. 또한 선로부호에 사용되는 여분의 비트를 이용하여 오류검출 능력을 증가시킬 수 있다. 결과적으로 제안된 부호는 Hamming (7.4) 부호를 이용한 기존의 오류정정선로부호에 비해 부호율은 다소 떨어지나 저주파대역에서의 스펙트럼 특성이 더 우수하며 더 적은 복호비트오율을 가진다.

• 정보보호학회논문지
• /
• 제16권5호
• /
• pp.47-57
• /
• 2006

모바일 Ad-hoc 네트워크는 인프라에 관계없이 동작하고 제3의 신뢰기관 없이 운용되어야 한다. 또한 네트워크 크기, 노드 이동성, 기기의 배터리 용량 및 메모리 크기 등에 의하여 구현상 제약을 받는다. 그럼에도 불구하고 유선 네트워크처럼 인증, 기밀성, 무결성, 부인방지, 접근통제, 그리고 가용성 등 보안문제에 대한 고려가 필요하다. 특히, 이러한 보안문제들 중에서 인증은 네트워크 특성에 상당한 영향을 받기 때문에 본 논문에서는 인증에 초점을 맞추었다. 본 논문은 Hamming Distance의 개념을 도입하여 모바일 Ad-hoc 네트워크에서 공개키 인증서 생성 갱신 폐지 등 공개키 인증서 관리를 위한 프로토콜 및 공개키 인증서 검증을 위한 경로구축 알고리즘을 제안하고 그 성능을 평가한다. 본 논문에서 제안하는 경로구축 알고리즘은 각 노드의 공개키 인증서 저장소 크기를 $log_2N$보다 작아도 공개키 인증서 경로구축이 가능하도록 하였다.

• Communications for Statistical Applications and Methods
• /
• 제19권6호
• /
• pp.899-904
• /
• 2012

High-dimensional categorical data models with small sample sizes have not been used extensively in genomic sequences that involve count (or discrete) or purely qualitative responses. A basic task is to identify differentially expressed genes (or positions) among a number of genes. It requires an appropriate test statistics and a corresponding multiple testing procedure so that a multivariate analysis of variance should not be feasible. A family wise error rate(FWER) is not appropriate to test thousands of genes simultaneously in a multiple testing procedure. False discovery rate(FDR) is better than FWER in multiple testing problems. The data from the 2002-2003 SARS epidemic shows that a conventional FDR procedure and a proposed test statistic based on a pseudo-marginal approach with Hamming distance performs better.