• Title/Summary/Keyword: linear code

Search Result 789, Processing Time 0.023 seconds

THE t-WISE INTERSECTION OF RELATIVE THREE-WEIGHT CODES

  • Li, Xin;Liu, Zihui
    • Bulletin of the Korean Mathematical Society
    • /
    • v.54 no.4
    • /
    • pp.1095-1110
    • /
    • 2017
  • The t-wise intersection is a useful property of a linear code due to its many applications. Recently, the second author determined the t-wise intersection of a relative two-weight code. By using this result and generalizing the finite projective geometry method, we will present the t-wise intersection of a relative three-weight code and its applications in this paper.

Experimental verification of the linear and non-linear versions of a panel code

  • Grigoropoulos, G.J.;Katsikis, C.;Chalkias, D.S.
    • International Journal of Naval Architecture and Ocean Engineering
    • /
    • v.3 no.1
    • /
    • pp.27-36
    • /
    • 2011
  • In the proposed paper numerical calculations are carried out using two versions of a three-dimensional, timedomain panel method developed by the group of Prof. P. Sclavounos at MIT, i.e. the linear code SWAN2, enabling optionally the use of the instantaneous non-linear Froude-Krylov and hydrostatic forces and the fully non-linear SWAN4. The analytical results are compared with experimental results for three hull forms with increasing geometrical complexity, the Series 60, a reefer vessel with stern bulb and a modern fast ROPAX hull form with hollow bottom in the stern region. The details of the geometrical modeling of the hull forms are discussed. In addition, since SWAN4 does not support transom sterns, only the two versions of SWAN2 were evaluated over experimental results for the parent hull form of the NTUA double-chine, wide-transom, high-speed monohull series. The effect of speed on the numerical predictions was investigated. It is concluded that both versions of SWAN2 the linear and the one with the non-linear Froude-Krylov and hydrostatic forces provide a more robust tool for prediction of the dynamic response of the vessels than the non-linear SWAN4 code. In general, their results are close to what was expected on the basis of experience. Furthermore, the use of the option of non-linear Froude-Krylov and hydrostatic forces is beneficial for the accuracy of the predictions. The content of the paper is based on the Diploma thesis of the second author, supervised by the first one and further refined by the third one.

Linear Suppression of Intercarrier Interference in Time-Varying OFDM Systems: From the Viewpoint of Multiuser Detection

  • Li, Husheng
    • Journal of Communications and Networks
    • /
    • v.12 no.6
    • /
    • pp.605-615
    • /
    • 2010
  • Intercarrier interference (ICI) in orthogonal frequency division multiplexing (OFDM) systems, which causes substantial performance degradation in time-varying fading channels, is analyzed. An equivalent spreading code formulation is derived based on the analogy of OFDM and code division multiple access (CDMA) systems. Techniques as linear multiuser detection in CDMA systems are applied to suppress the ICI in OFDM systems. The performance of linear detection, measured using multiuser efficiency and asymptotic multiuser efficiency, is analyzed given the assumption of perfect channel state information (CSI), which serves as an upper bound for the performance of practical systems. For systems without CSI, time domain and frequency domain channel estimation based linear detectors are proposed. The performance gains and robustness of a linear minimum mean square error (LMMSE) filter over a traditional filter (TF) and matched filter (MF) in the high signal-to-noise ratio (SNR) regime are demonstrated with numerical simulation results.

부호이론의 개념 선형부호편

  • 이만영
    • The Magazine of the IEIE
    • /
    • v.11 no.1
    • /
    • pp.11-18
    • /
    • 1984
  • 부호이론(coding theory)은 그 내용이 매우 광범위할 뿐 아니라 군론, 환론, 본론 등 축예대수학과 확율론 및 수리통계학을 배경으로 발전된 학문이기 때문에 일반 속자를 상대로 논술하기에는 적지 않은 난점이 있다. 그렇다고 단순히 용어나열에만 그칠 수도 없고, 이론에 치중한 논문식으로 쓸수도 없으므로 대학 4년생을 위한 강의수준으로 소개하겠으며 3회에 걸쳐 선형부호(linear code), 순회부호(cyclic code), 길쌈부호(convolutional code)의 순으로 연재하기로 하겠다.

  • PDF

길이가 16인 Z$_4$위의 Preparata 부호는 연쇄조건을 만족하지 않는다

  • Kyeongcheol Yang;Dooroo Lim
    • 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.

  • PDF

Energy Efficiency in Wireless Sensor Networks using Linear-Congruence on LDPC codes (LDPC 코드의 Linear-Congruence를 이용한 WSN 에너지 효율)

  • Rhee, Kang-Hyeon
    • Journal of the Institute of Electronics Engineers of Korea CI
    • /
    • v.44 no.3
    • /
    • pp.68-73
    • /
    • 2007
  • Recently, WSN(wireless sensor networks) consists of several sensor nodes in sensor field. And each sensors have the enforced energy constraint. Therefore, it is important to manage energy efficiently. In WSN application system, FEC(Forward error correction) increases the energy efficiency and data reliability of the data transmission. LDPC(Low density parity check) code is one of the FEC code. It needs more encoding operation than other FEC code by growing codeword length. But this code can approach the Shannon capacity limit and it is also can be used to increase the data reliability and decrease the transmission energy. In this paper, the author adopt Linear-Congruence method at generating parity check matrix of LDPC(Low density parity check) codes to reduce the complexity of encoding process and to enhance the energy efficiency in the WSN. As a result, the proposed algorithm can increase the encoding energy efficiency and the data reliability.

Validation of 3D discrete fracture network model focusing on areal sampling methods-a case study on the powerhouse cavern of Rudbar Lorestan pumped storage power plant, Iran

  • Bandpey, Abbas Kamali;Shahriar, Kourush;Sharifzadeh, Mostafa;Marefvand, Parviz
    • Geomechanics and Engineering
    • /
    • v.16 no.1
    • /
    • pp.21-34
    • /
    • 2018
  • Discontinuities considerably affect the mechanical and hydraulic properties of rock mass. These properties of the rock mass are influenced by the geometry of the discontinuities to a great extent. This paper aims to render an account of the geometrical parameters of several discontinuity sets related to the surrounding rock mass of Rudbar Lorestan Pumped Storage Power Plant powerhouse cavern making use of the linear and areal (circular and rectangular) sampling methods. Taking into consideration quite a large quantity of scanline and the window samplings used in this research, it was realized that the areal sampling methods are more time consuming and cost-effective than the linear methods. Having corrected the biases of the geometrical properties of the discontinuities, density (areal and volumetric) as well as the linear, areal and volumetric intensity accompanied by the other properties related to four sets of discontinuities were computed. There is an acceptable difference among the mean trace lengths measured using two linear and areal methods for the two joint sets. A 3D discrete fracture network generation code (3DFAM) has been developed to model the fracture network based on the mapped data. The code has been validated on the basis of numerous geometrical characteristics computed by use of the linear, areal sampling methods and volumetric method. Results of the linear sampling method have significant variations. So, the areal and volumetric methods are more efficient than the linear method and they are more appropriate for validation of 3D DFN (Discrete Fracture Network) codes.

AN UPPER BOUND ON THE NUMBER OF PARITY CHECKS FOR BURST ERROR DETECTION AND CORRECTION IN EUCLIDEAN CODES

  • Jain, Sapna;Lee, Ki-Suk
    • Journal of the Korean Mathematical Society
    • /
    • v.46 no.5
    • /
    • pp.967-977
    • /
    • 2009
  • There are three standard weight functions on a linear code viz. Hamming weight, Lee weight, and Euclidean weight. Euclidean weight function is useful in connection with the lattice constructions [2] where the minimum norm of vectors in the lattice is related to the minimum Euclidean weight of the code. In this paper, we obtain an upper bound over the number of parity check digits for Euclidean weight codes detecting and correcting burst errors.

Low Complexity Ordered Successive Cancellation Algorithm for Multi-user STBC Systems

  • Le, Van-Hien;Yang, Qing-Hai;Kwak, Kyung-Sup
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.32 no.2A
    • /
    • pp.162-168
    • /
    • 2007
  • This paper proposes two detection algorithms for Multi-user Space Time Block Code systems. The first one is linear detection Gaussian Elimination algorithm, and then it combined with Ordered Successive Cancellation to get better performance. The comparisons between receiver and other popular receivers, including linear receivers are provided. It will be shown that the performance of Gaussian Elimination receiver is similar but more simplicity than linear detection algorithms and performance of Gaussian Elimination Ordered Successive Cancellation superior as compared to other linear detection method.

New Design for Linear Complex Precoding over ABBA Quasi-Orthogonal Space-Time Block Codes

  • Ran, Rong;Yang, Jang-Hoon;An, Chan-Ho;Kim, Dong-Ku
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.33 no.12C
    • /
    • pp.1062-1067
    • /
    • 2008
  • ABBA codes, a class of quasi-orthognal space-time block codes (QoSTBC) proposed by Tirkkonen and others, allow full rate and a fast maximum likelihood (ML) decoding, but do not have full diversity. In this paper, a linear complex precoder is proposed for ABBA codes to achieve full rate and full diversity. Moreover, the same diversity produce as that of orthogonal space-time block code with linear complex precoder (OSTBC-LCP) is achieved. Meanwhile, the size of the linear complex precoder can be reduced by half without affecting performance, which means the same complexity of decoding as that of the conventional ABBA code is guaranteed.