• 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.

• Journal of the Korea Institute of Military Science and Technology
• /
• v.8 no.3 s.22
• /
• pp.42-50
• /
• 2005

In this paper, a novel method is proposed how the ECC(Error Correction Code) in server system can be investigated and the robustness of each system against noisy environment and element failure in memory module has been verified. Chipset manufacturers have hided the algorithm of their Hamming code and the user has difficulty in verification of the robustness of each system. The proposed method is very simple, but the outputs of the experiment explain the core ability of error correction in server system and helps the detection of the failure element. On the basis of these results, we could expect the robustness of digitalized weapon system and the efficient design of our own error correction code.

• Journal of the Korean Mathematical Society
• /
• v.50 no.3
• /
• pp.509-527
• /
• 2013

A Krawtchouk polynomial is introduced as the classical Mac-Williams identity, which can be expressed in weight-enumerator-free form of a linear code and its dual code over a Hamming scheme. In this paper we find a new explicit expression for the $p$-number and the $q$-number, which are more generalized notions of the Krawtchouk polynomial in the P-polynomial schemes by using an extended version of a discrete Green's function. As corollaries, we obtain a new expression of the Krawtchouk polynomial over the Hamming scheme and the Eberlein polynomial over the Johnson scheme. Furthermore, we find another version of the MacWilliams identity over a Hamming scheme.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.12
• /
• pp.6159-6174
• /
• 2019

Recently, Kim et al. introduced the Hamming + k with m overlapped pixels data hiding (Hk_mDH) based on matrix encoding. The embedding rate (ER) of this method is 0.54, which is better than Hamming code HC (n, n - k) and HC (n, n - k) +1 DH (H1DH), but not enough. Hamming code data hiding (HDH) is using a covering function COV(1, n = 2^k -1, k) and H1DH has a better embedding efficiency, when compared with HDH. The demerit of this method is that they do not exploit their space of pixels enough to increase ER. In this paper, we increase ER using sequential Hk_mDH (SHk_mDH ) through fully exploiting every pixel in a cover image. In SHk_mDH, a collision maybe happens when the position of two pixels within overlapped two blocks is the same. To solve the collision problem, in this paper, we have devised that the number of modification does not exceed 2 bits even if a collision occurs by using OPAP and LSB. Theoretical estimations of the average mean square error (AMSE) for these schemes demonstrate the advantage of our SHk_mDH scheme. Experimental results show that the proposed method is superior to previous schemes.

• Proceedings of the Korea Institutes of Information Security and Cryptology Conference
• /
• 1996.11a
• /
• pp.286-294
• /
• 1996

In a remarkable paper 〔3〕, Hammons et al. showed that, when properly defined, the binary nonlinear Preparata code can be considered as the Gray map of a linear code eve. Z$_4$, the so-called Preparata code eve. Z$_4$. Recently, Yang and Helleseth 〔12〕 considered the generalized Hamming weights d$\_$r/(m) for Preparata codes of length 2$\^$m/ over Z$_4$ and exactly determined d$\_$r/, for r = 0.5,1.0,1.5,2,2.5 and 3.0. In particular, they completely determined d$\_$r/(m) for any r in the case of m $\leq$ 6. In this paper we show that the Preparata code of length 16 over Z$_4$ does not satisfy the chain condition.

• Journal of the Korean Institute of Telematics and Electronics A
• /
• v.33A no.2
• /
• pp.32-39
• /
• 1996

Hybrid decision decoding for the extended hamming codes without retransmission, which is a combination of hard and soft decision decoding, is proposed and its performance is analyzed in this paper. As results, hybsrid decision decoding shows a little bit higher residual bit error rate than soft decision decoding. However, as the size of the extended hamming code increases, the difference of th enumber of comparisons increases further. In addition, hybrid decision decoding shows almost same residual bit error rate as hard decision decoding with retrassmission and shows much lower residual bit error rate than hard decision decoding without retransmission.

• 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.

• Journal of Intelligence and Information Systems
• /
• v.13 no.4
• /
• pp.35-44
• /
• 2007

This paper proposes a new method of weighted template matching for machine-printed numeral recognition. The proposed weighted template matching, which emphasizes the feature of a pattern using adaptive Hamming distance on local feature areas, improves the recognition rate while template matching processes an input image as one global feature. Template matching is vulnerable to random noises that generate ragged outlines of a pattern when it is binarized. This paper offers a method of chain code trimming in order to remove ragged outlines. The method corrects specific chain codes within the chain codes of the inner and the outer contour of a pattern. The experiment compares confusion matrices of both the template matching and the proposed weighted template matching with chain code trimming. The result shows that the proposed method improves fairly the recognition rate of the machine-printed numerals.

• Journal of Astronomy and Space Sciences
• /
• v.22 no.4
• /
• pp.537-558
• /
• 2005

This paper addresses the results of HAUSAT-2 radiation environment and effect analyses, including TID and SEE analyses. Trapped proton and electron, solar proton, galactic cosmic ray models were considered for HAUSAT-2 TID radiation environment analysis. TID was analyzed through total dose-depth curve and the radiation tolerance of TID for HAUSAT-2 components was verified by using DMBP method and sectoring analysis. HAUSAT-2 LET spectrum for heavy ion and proton were also analyzed for SEE investigation. SEE(SEU, SEL) analyses were accomplished for MPC860T2B microprocessor and K6X8008T2B memory. It was estimated that several SEUs may occur without SEL during the HAUSAT-2 mission life(2 years). Software Hamming Code EDAC has been implemented to detect and correct the SEU. In this study, all radiation analyses were conducted by using SPENVIS software.

• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• v.15 no.4
• /
• pp.230-236
• /
• 2022

In this paper, we propose an efficient concatenated code for both random and ISI errors on diffusion-based molecular communication channels. The proposed concatenated code was constructed by combining the ISI-mitigating code designed for ISI mitigation and the ISI-Hamming code strong against random errors, and the BER(bit error rate) performance was analyzed through simulation. In the case of the above M=1,200 channel environment, it was found that the error rate performance of the concatenated code follows the error rate performance of the ISI-mitigating code, which is strong against ISI, and follows the error rate performance of the ISI-Hamming code, which is strong against random errors, in the channel environment below M=600. In M=600~1,200, the concatenated code shows the best error rate performance among those of three codes, which is analyzed because it can correct both random errors and errors caused by ISI. In the following cases of below M=800, it can be seen that the error rate of the concatenated code and the ISI-mitigating code shows an error rate difference of about 1.0×10^-1 on average.