• Title/Summary/Keyword: extended codes

Search Result 108, Processing Time 0.022 seconds

Extension of Minimal Codes for Application to Distributed Learning (분산 학습으로의 적용을 위한 극소 부호의 확장 기법)

  • Jo, Dongsik;Chung, Jin-Ho
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.26 no.3
    • /
    • pp.479-482
    • /
    • 2022
  • Recently, various artificial intelligence technologies are being applied to smart factory, finance, healthcare, and so on. When handling data requiring protection of privacy, distributed learning techniques are used. For distribution of information with privacy protection, encoding private information is required. Minimal codes has been used in such a secret-sharing scheme. In this paper, we explain the relationship between the characteristics of the minimal codes for application in distributed systems. We briefly deals with previously known construction methods, and presents extension methods for minimal codes. The new codes provide flexibility in distribution of private information. Furthermore, we discuss application scenarios for the extended codes.

Optimal Heterogeneous Distributed Storage Regenerating Code at Minimum Remote-Repair Bandwidth Regenerating Point

  • Xu, Jian;Cao, Yewen;Wang, Deqiang;Wu, Changlei;Yang, Guang
    • ETRI Journal
    • /
    • v.38 no.3
    • /
    • pp.529-539
    • /
    • 2016
  • Recently, a product-matrix (PM) framework was proposed to construct optimal regenerating codes for homogeneous distributed storage systems (DSSs). In this paper, we propose an extended PM (EPM) framework for coding of heterogeneous DSSs having different repair bandwidths but identical storage capacities. Based on the EPM framework, an explicit construction of minimum remote-repair bandwidth regenerating (MRBR) codes is presented for a specific heterogeneous DSS, where two geographically different datacenters with associated storage nodes are deployed. The data reconstruction and regeneration properties of the MRBR code are proved strictly. For the purpose of demonstration, an example implementation of MRBR code is provided. The presented MRBR code is the first optimal strict-regenerating code for heterogeneous DSSs. In addition, our proposed EPM framework can be applied to homogeneous systems also.

Performance and Energy Consumption Analysis of 802.11 with FEC Codes over Wireless Sensor Networks

  • Ahn, Jong-Suk;Yoon, Jong-Hyuk;Lee, Kang-Woo
    • Journal of Communications and Networks
    • /
    • v.9 no.3
    • /
    • pp.265-273
    • /
    • 2007
  • This paper expands an analytical performance model of 802.11 to accurately estimate throughput and energy demand of 802.11-based wireless sensor network (WSN) when sensor nodes employ Reed-Solomon (RS) codes, one of block forward error correction (FEC) techniques. This model evaluates these two metrics as a function of the channel bit error rate (BER) and the RS symbol size. Since the basic recovery unit of RS codes is a symbol not a bit, the symbol size affects the WSN performance even if each packet carries the same amount of FEC check bits. The larger size is more effective to recover long-lasting error bursts although it increases the computational complexity of encoding and decoding RS codes. For applying the extended model to WSNs, this paper collects traffic traces from a WSN consisting of two TIP50CM sensor nodes and measures its energy consumption for processing RS codes. Based on traces, it approximates WSN channels with Gilbert models. The computational analyses confirm that the adoption of RS codes in 802.11 significantly improves its throughput and energy efficiency of WSNs with a high BER. They also predict that the choice of an appropriate RS symbol size causes a lot of difference in throughput and power waste over short-term durations while the symbol size rarely affects the long-term average of these metrics.

A Study on the Improved Parity Check Receiver for the Extended m-sequence Based Multi-code Spread Spectrum System with Code Set Partitioning and Constant Amplitude Precoding (코드집합 분할 방식의 확장 m-시퀀스 기반 정진폭 멀티코드 대역확산 통신 시스템을 위한 개선된 패리티 검사 기반 수신기에 관한 연구)

  • Han, Jun-Sang;Kim, Dong-Joo;Kim, Myoung-Jin
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.49 no.8
    • /
    • pp.1-11
    • /
    • 2012
  • The multi-code spread spectrum communication system, which spreads data bit stream by multiplexing orthogonal codes, can transmit data in high rate. However it needs the high-cost good linear amplifier because of the multi-level output signal. In order to overcome this drawback several systems making the amplitude of output signal constant with Walsh codes have been proposed. Recently constant amplitude pre-coded multi-code spread spectrum systems using extended m-sequence have been proposed. In this paper we consider an extended m-sequence based constant amplitude multi-code spread spectrum system with code set partitioning. By grouping the orthogonal codes into 4 subsets, not only is the computational complexity of the transceiver reduced but BER performance also improves. It has been shown that parity checking on four detected codes at the receiver can correct code detection error and result in BER performance enhancement. In this paper we propose a improved parity check receiver. We carried out computer simulation to verify feasibility of the proposed algorithm.

A New Extension Method for Minimal Codes (극소 부호의 새로운 확장 기법)

  • Chung, Jin-Ho
    • Journal of IKEEE
    • /
    • v.26 no.3
    • /
    • pp.506-509
    • /
    • 2022
  • In a secret sharing scheme, secret information must be distributed and stored to users, and confidentiality must be able to be reconstructed only from an authorized subset of users. To do this, secret information among different code words must not be subordinate to each other. The minimal code is a kind of linear block code to distribute these secret information not mutually dependent. In this paper, we present a novel extension technique for minimal codes. The product of an arbitrary vector and a minimal code produces a new minimal code with an extended length and Hamming weight. Accordingly, it is possible to provide minimal codes with parameters not known in the literature.

A Study on an Extended Cyber Attack Tree for an Analysis of Network Vulnerability (네트워크 취약성 분석을 위한 확장된 사이버 공격 트리에 관한 연구)

  • Eom, Jung Ho;Park, Seon Ho;Chung, Tai M.
    • Journal of Korea Society of Digital Industry and Information Management
    • /
    • v.6 no.3
    • /
    • pp.49-57
    • /
    • 2010
  • We extended a general attack tree to apply cyber attack model for network vulnerability analysis. We defined an extended cyber attack tree (E-CAT) which extends the general attack tree by associating each node of the tree with a transition of attack that could have contributed to the cyber attack. The E-CAT resolved the limitation that a general attack tree can not express complex and sophisticate attacks. Firstly, the Boolean expression can simply express attack scenario with symbols and codes. Secondary, An Attack Generation Probability is used to select attack method in an attack tree. A CONDITION-composition can express new and modified attack transition which a aeneral attack tree can not express. The E-CAT is possible to have attack's flexibility and improve attack success rate when it is applied to cyber attack model.

Monte Carlo Resonance Treatment for the Deterministic Transport Lattice Codes

  • Kim Kang-Seog;Lee Chung Chan;Chang Moon Hee;Zee Sung Quun
    • Nuclear Engineering and Technology
    • /
    • v.35 no.6
    • /
    • pp.581-595
    • /
    • 2003
  • Transport lattice codes require the resonance integral tables for the resonant nuclides where the resonance integral is a function of the background cross section and can be prepared through a special program solving the slowing down equation. In case the cross section libraries do not include the resonance integral table for the resonant nuclides, the computational prediction produces a large error. We devised a new method using a Monte Carlo calculation for the effective resonance cross sections to solve this problem provisionally. We extended this method to obtain the resonance integral table for general purpose. The MCNP code is used for the effective resonance integrals and the LIBERTE code for the effective background cross sections. We modified the HELIOS library with the effective cross sections and the resonance integral tables obtained by the newly developed Monte Carlo method, and performed sample calculations using HELIOS and LIBERTE. The results showed that this method is very effective for the resonance treatment.

A Study on the Fire-Safety Design for the Historic Buildings (역사적 건조물의 화재안전을 위한 기초연구)

  • Lee Ji-Hee
    • Journal of the Korean housing association
    • /
    • v.15 no.6
    • /
    • pp.107-113
    • /
    • 2004
  • Fire was and remains a great threat to historic buildings of wood. This threat is omnipresent and often results to irreparable property losses especially cultural heritages. Fire of historic buildings continues to increase every year. The purpose of this study is to preserve a life safety, historical heritage and architectural & cultural values by pursuing for fire safety in the historical buildings. This study shall employ two research methods: a literature review and field survey methods. The literature review shall focus on the observations of characteristics noted in fire codes. The field survey shall cover a heat analysis and fire protection equipment. A method is proposed to investigate fire codes related historical building, reported fire history Fire Codes and Regulations for modern buildings are not always applicable on the historic buildings. Old buildings, and some new buildings with architectural, historical or cultural importance may have values which cannot be measured on a monetary scale. Their protection against the damage caused by fire is considered to be one of the basic moral duties of society. It is strongly recommended, therefore, legislation for fire safety in historical buildings must be extended to a complementary relationship with 'active' fire protection measures, to provide safety in real historical building in real fire situations. The development and application of performance based Codes and the Fire Safety Engineering approach seems to be a rather reasonable and effective way to deal with this historical buildings.

Comparison of the seismic performance of existing RC buildings designed to different codes

  • Zeris, Christos A.;Repapis, Constantinos C.
    • Earthquakes and Structures
    • /
    • v.14 no.6
    • /
    • pp.505-523
    • /
    • 2018
  • Static pushover analyses of typical existing reinforced concrete frames, designed according to the previous generations of design codes in Greece, have established these structures' inelastic characteristics, namely overstrength, global ductility capacity and available behaviour factor q, under planar response. These were compared with the corresponding demands at the collapse limit state target performance point. The building stock considered accounted for the typical variability, among different generations of constructed buildings in Greece, in the form, the seismic design code in effect and the material characteristics. These static pushover analyses are extended, in the present study, in the time history domain. Consequently, the static analysis predictions are compared with Incremental Dynamic Analysis results herein, using a large number of spectrum compatible recorded base excitations of recent destructive earthquakes in Greece and abroad, following, for comparison, similar conventional limiting failure criteria as before. It is shown that the buildings constructed in the 70s exhibit the least desirable behaviour, followed by the buildings constructed in the 60s. As the seismic codes evolved, there is a notable improvement for buildings of the 80s, when the seismic code introduced end member confinement and the requirement for a joint capacity criterion. Finally, buildings of the 90s, designed to modern codes exhibit an exceptionally good performance, as expected by the compliance of this code to currently enforced seismic provisions worldwide.

The Reduction of the Searching Candidates for the GPS Signal Acquisition (GPS 초기 동기를 위한 탐색 후보 축소)

  • 서흥석;강설묵;이상정
    • Journal of the Korea Institute of Military Science and Technology
    • /
    • v.6 no.1
    • /
    • pp.91-107
    • /
    • 2003
  • A 2-dimensional search process in the time and frequency domain is required to acquire the GPS signal, when the code phase and the carrier Doppler for the specified GPS satellite signal are unknown. This paper proposes a new scheme, called Squared-D Searching Method, which can reduce the number of carrier frequency candidates, and a new scheme, named extended Multiple Correlator(XMC), which can reduce the number of code phase candidates. The Squared-D Searching Method can take the twice of Doppler frequency, therefore it can find carrier frequency candidates. The XMC is different from the general multiple correlator in that a combined form of the locally generated codes is used for despreading. Also, this paper tries to analyze a signal detection probability of a GPS receiver under more realistic environments. The result shows that lower detection probability can be obtained when the phase differences among the codes are larger in the correlation arms of a multiple correlator. This phenomenon is not easy to explain with the previous results. And besides, the result shows that proposed acquisition schemes give better performance than a conventional acquisition scheme.