• Title/Summary/Keyword: hamming code

Search Result 92, Processing Time 0.065 seconds

Design of Block Codes for Distributed Learning in VR/AR Transmission

  • Seo-Hee Hwang;Si-Yeon Pak;Jin-Ho Chung;Daehwan Kim;Yongwan Kim
    • Journal of information and communication convergence engineering
    • /
    • v.21 no.4
    • /
    • pp.300-305
    • /
    • 2023
  • Audience reactions in response to remote virtual performances must be compressed before being transmitted to the server. The server, which aggregates these data for group insights, requires a distribution code for the transfer. Recently, distributed learning algorithms such as federated learning have gained attention as alternatives that satisfy both the information security and efficiency requirements. In distributed learning, no individual user has access to complete information, and the objective is to achieve a learning effect similar to that achieved with the entire information. It is therefore important to distribute interdependent information among users and subsequently aggregate this information following training. In this paper, we present a new extension technique for minimal code that allows a new minimal code with a different length and Hamming weight to be generated through the product of any vector and a given minimal code. Thus, the proposed technique can generate minimal codes with previously unknown parameters. We also present a scenario wherein these combined methods can be applied.

Fault Tolerant Encryption and Data Compression under Ubiquitous Environment (Ubiquitous 환경 하에서 고장 극복 암호 및 데이터 압축)

  • You, Young-Gap;Kim, Han-Byeo-Ri;Park, Kyung-Chang;Lee, Sang-Jin;Kim, Seung-Youl;Hong, Yoon-Ki
    • The Journal of the Korea Contents Association
    • /
    • v.9 no.8
    • /
    • pp.91-98
    • /
    • 2009
  • This paper presents a solution to error avalanche of deciphering where radio noise brings random bit errors in encrypted image data under ubiquitous environment. The image capturing module is to be made comprising data compression and encryption features to reduce data traffic volume and to protect privacy. Block cipher algorithms may experience error avalanche: multiple pixel defects due to single bit error in an encrypted message. The new fault tolerant scheme addresses error avalanche effect exploiting a three-dimensional data shuffling process, which disperses error bits on many frames resulting in sparsely isolated errors. Averaging or majority voting with neighboring pixels can tolerate prominent pixel defects without increase in data volume due to error correction. This scheme has 33% lower data traffic load with respect to the conventional Hamming code based approach.

Development of Elementary learning materials for Data error detection and correction (데이터 에러 검출과 수정에 대한 초등교육자료 개발)

  • Ko, Hyeongcheol;Kim, Chongwoo
    • Journal of The Korean Association of Information Education
    • /
    • v.22 no.1
    • /
    • pp.169-176
    • /
    • 2018
  • CS Unplugged education at the base of computer science is emphasized as an instrument for teaching the basic principles of elementary SW education, but these materials for elementary education are very lacking. So We'll present the data error detection and correction materials for elementary school classes. Based on previous studies related to this topic, we developed learning materials for elementary higher grade students using Hamming code. We introduces the card magic in the introduction part. 'error detection and correction' learning materials based on the principle of Hamming code, were composed as activity-based education. The results of the questionnaire survey showed that it had a positive effect on improving learners' understanding of computer science.

Peak-to-Average Power Ratio Reduction Using N-tuple Selective Mapping Method for MC-CDMA

  • Ali, Sajjad;Chen, Zhe;Yin, Fuliang
    • ETRI Journal
    • /
    • v.37 no.2
    • /
    • pp.338-347
    • /
    • 2015
  • The multi-carrier transmission signal in Multi-Carrier Code Division Multiple Access (MC-CDMA) has a high peak-to-average power ratio (PAPR), which results in nonlinear distortion and deteriorative system performance. An n-tuple selective mapping method is proposed to reduce the PAPR, in this paper. This method generates $2^n$ sequences of an original data sequence by adding n-tuple of n PAPR control bits to it followed by an interleaver and error-control code (ECC) to reduce its PAPR. The convolutional, Golay, and Hamming codes are used as ECCs in the proposed scheme. The proposed method uses different numbers of the n PAPR control bits to accomplish a noteworthy PAPR reduction and also avoids the need for a side-information transmission. The simulation results authenticate the effectiveness of the proposed method.

Error Resilient and Concealment Schemes for Still Image Transmission over DSRC System Channel (DSRC시스템 채널 환경에서 정지 영상 전송을 위한 에러 복구 및 은닉 기법)

  • 최은석;백중환
    • Proceedings of the IEEK Conference
    • /
    • 2001.06d
    • /
    • pp.13-16
    • /
    • 2001
  • In the Dedicated Short Range Communication (DSRC) system channel, a large number of bit errors occur because of Additive White Gaussian Noise (AWGN) and fading. When an image data is transmitted under the condition, reconstructed image quality is significantly degraded. In this paper, as an alternative to the error correcting code and/or automatic repeat request scheme, we propose an error recovery scheme for image data transmission. We first analyze how transmission errors in the DSRC system channel degrade image quality. Then, in order to improve image quality, we propose error resilient and concealment schemes for still image transmission using DCT-based fixed length coding, hamming code, cyclic redundancy check, and interleaver. Finally, we show its performance by an experiment.

  • PDF

CONSTRUCTION OF SELF-DUAL CODES OVER F2 + uF2

  • Han, Sung-Hyu;Lee, Hei-Sook;Lee, Yoon-Jin
    • Bulletin of the Korean Mathematical Society
    • /
    • v.49 no.1
    • /
    • pp.135-143
    • /
    • 2012
  • We present two kinds of construction methods for self-dual codes over $\mathbb{F}_2+u\mathbb{F}_2$. Specially, the second construction (respectively, the first one) preserves the types of codes, that is, the constructed codes from Type II (respectively, Type IV) is also Type II (respectively, Type IV). Every Type II (respectively, Type IV) code over $\mathbb{F}_2+u\mathbb{F}_2$ of free rank larger than three (respectively, one) can be obtained via the second construction (respectively, the first one). Using these constructions, we update the information on self-dual codes over $\mathbb{F}_2+u\mathbb{F}_2$ of length 9 and 10, in terms of the highest minimum (Hamming, Lee, or Euclidean) weight and the number of inequivalent codes with the highest minimum weight.

Sub Oriented Histograms of Local Binary Patterns for Smoke Detection and Texture Classification

  • Yuan, Feiniu;Shi, Jinting;Xia, Xue;Yang, Yong;Fang, Yuming;Wang, Rui
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.10 no.4
    • /
    • pp.1807-1823
    • /
    • 2016
  • Local Binary Pattern (LBP) and its variants have powerful discriminative capabilities but most of them just consider each LBP code independently. In this paper, we propose sub oriented histograms of LBP for smoke detection and image classification. We first extract LBP codes from an image, compute the gradient of LBP codes, and then calculate sub oriented histograms to capture spatial relations of LBP codes. Since an LBP code is just a label without any numerical meaning, we use Hamming distance to estimate the gradient of LBP codes instead of Euclidean distance. We propose to use two coordinates systems to compute two orientations, which are quantized into discrete bins. For each pair of the two discrete orientations, we generate a sub LBP code map from the original LBP code map, and compute sub oriented histograms for all sub LBP code maps. Finally, all the sub oriented histograms are concatenated together to form a robust feature vector, which is input into SVM for training and classifying. Experiments show that our approach not only has better performance than existing methods in smoke detection, but also has good performance in texture classification.

Integer Programming Models for the Design of Two-Dimensional Holographic Storage Modulation Code (2차원 홀로그래픽 변조부호 설계를 위한 정수계획법 모형)

  • Park, Taehyung;Lee, Jaejin
    • 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.

Optimization of CVQ codebook index for noisy channels (잡음이 존재하는 채널에서 이용되는 분류 벡터 양자화 코드북의 인덱스할당기법)

  • 한종기;김진욱
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.28 no.3C
    • /
    • pp.315-326
    • /
    • 2003
  • Abstract In this paper, an improved index assignment procedure is proposed to reduce the channel error effect in a communication system employing classified vector quantization(CVQ). The proposed algorithm consists of two parts: inner index assignment (IIA) and cross index assignment (CIA). The II A reduces the distortion resulting from the error in order bits, presenting the identity of each code vector in a subcodebook. The CIA modifies the indexes assigned by the IIA in such a way that the effect of the channel error occurring in class bits, indicating the class information of the code vector, can be minimized. Simulation results show that the proposed algorithms enable a reliable communication over noisy channels even without employing the channel encoding. Index Terms Classified vector quantization, index assignment.

Performance Evaluation of Hybrid DS/SFH-CDMA Noncoherent MFSK Signal with Channel Coding and MRC Diversity Techniques in Mobile Communication Nakagami Fading Channels (이동통신 Nakagami 페이딩 채널에서 채널코딩과 최대비합성 다이버시티 기법에 의한 Hybrid DS / SFH-CDMA 비동기 MFSK 신호의 성능평가)

  • ;Norihiko Morinaga
    • The Journal of Korean Institute of Electromagnetic Engineering and Science
    • /
    • v.8 no.4
    • /
    • pp.342-353
    • /
    • 1997
  • This paper presents an analytical evaluation of a hybrid direct-sequence/slow frequencyhopped code division multiple-access (DS/SFH-CDMA) system employing noncoherent M-ary frequency shift keying(MFSK) modulation in a multiple Nakagami fading (m) environment. Multipath interference (MPI) and multi-access interference (MAI) is taken into account and the spectral efficiency is calculated for uncoded as well as channel coding systems. Predetection multipath maximal ratio combining (MRC) diversity in conjunction with interleaved channel coding (Hamming(7,4) code, BCH(15, 7) code and RS (7, 4), (15, 9)) code ) is employed for improving the bit error rate (BER) performance. The BER of noncoherent hybrid system is obtained using a Gaussian interference approximation.

  • PDF