• Journal of applied mathematics & informatics
• /
• v.28 no.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.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.50 no.7
• /
• pp.175-180
• /
• 2013

For the traitor tracing of multimedia content, this paper presents the classification algorithm of XOR collusion attack types using hamming distance, which applies to the colluded fingerprinting codes. The conventional traitor decision hinges on the colluded fingerprinting code used by a correlation coefficient, but the proposed scheme uses hamming distance. While XOR collusion attack employing a correlation coefficient is impossible to trace the traitors about 50% colluders due to a serious XOR linear problem, our method improves the performance of traceability to trace at least 1 traitor using hamming distance, and thus, the functional behavior of the proposed traitor traceability is coincided with Probability Scheme.

• Proceedings of the IEEK Conference
• /
• 1998.06a
• /
• 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.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.27 no.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
• /
• v.43 no.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.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.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
• /
• v.5 no.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$.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.19 no.5
• /
• pp.912-919
• /
• 1994

A new error control line code based on an extended Hamming code is proposed and its performance is analyzed in this paper. The proposed code is capable of single error correction and double error detection since its minimum Hamming distance is 4. In addition, the error detection capability can be oncreased due to the redundancy bit used for line coding. As a result, the proposed code shows lower code rate, but better spectral characteristics in low frequency region and lower residual bit error rate than the conventional error correction line code using Hamming (7, 4) code.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.16 no.5
• /
• pp.47-57
• /
• 2006

Mobile Ad-hoc networks have various implementation constraints such as infrastructure-free, no trusted authority, node mobility, and the limited power and small memory of mobile device. And just like wired networks, various security issues such as authentication, confidentiality, integrity, non-repudiation, access control, availability and so on have been arisen in mobile Ad-hoc networks. But we focus on authentication of these security issues because it is quitely affected by the characteristics of networks. In this paper, we propose the authentication protocol that can limit the size of certificate repository as $log_2N$ and assures to make a trusted certificate path from one node to another, adopting the concept of Hamming distance. Particularly, our protocol can construct a trusted certificate path in spite of decreasing or increasing the number of nodes in mobile Ad-hoc network.

• Communications for Statistical Applications and Methods
• /
• v.19 no.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.