Search Constraints

Start Over
Filtering by: Creator Rau, Weldon W. Remove constraint Creator: Rau, Weldon W. Advisor Bose, Bella Remove constraint Advisor: Bose, Bella

Search Results

  • Recursive construction for error correcting constant weight codes

    Creator:
    Ramanathan, Gowri
    Abstract:
    In this project we have designed a new construction method for t error correcting constant weight codes. This method is an improvement over the existing codes in terms of information rate. The construction method is recursive as it is based on the observation that 2t error correcting code can be...
    Resource Type:
    Capstone Project
    Full Text:
    ) ) Notations k - length of the datapart w - wight of the datapart V - set of k-tuples of weight w v

  • Error control techniques for the Z-channel

    Creator:
    Oprisan, Paul
    Abstract:
    The asymmetric nature of bit errors in several practical applications provides grounds for efficient error control techniques. The Z-channel model and special classes of codes like asymmetric error detection codes and t-asymmetric error correcting/d-asymmetric error detecting codes can be successfully used in ARQ protocols for feedback error control enhancement. This...
    Resource Type:
    Dissertation
    Full Text:
    also optimal. Borden [7] proposed a d-UED code in which codewords of length n have weight w that is

  • On asymmetric error-correcting codes

    Creator:
    Cunningham, Robert Stephen
    Abstract:
    Historically, coding theory has dealt with binary codes correcting symmetric errors, in which errors are made in both 0 and 1 bits with equal likelihood. Within the past ten years, some study has been made of asymmetric codes, under the assumption that the only errors which occur are errors in...
    Resource Type:
    Masters Thesis
    Full Text:
    . [7] Peterson, W. Wesley and E. J. Weldon, Jr., Error Correcting Codes, 2nd edition, MIT Press

  • Properties and communication algorithms for k-ary n-cube interconnection networks

    Creator:
    Ashir, Yaagoub A.
    Abstract:
    The k-ary n-cube structure is presented in this paper for interconnecting a network of microcomputers in parallel and distributed environments. Machines based on the k-ary n-cube topology have been advocated as ideal parallel architectures for their powerful interconnecting features. In this paper, we examine the k-ary n-cube from the graph...
    Resource Type:
    Capstone Project
    Full Text:
    for Information and Decision Systems, MIT, Cambridge, MA (1987). W. Peterson and E. Weldon, JR

  • Unidirectional error correcting/detecting codes

    Creator:
    Lin, Der Jei
    Abstract:
    An extensive theory of symmetric error control coding has been developed in the last few decades. The recently developed VLSI circuits, ROM, and RAM memories have given an impetus to the extension of error control coding to include asymmetric and unidirectional types of error control. The maximal numbers of unidirectional...
    Resource Type:
    Dissertation
    Full Text:
    code is no more than w =Ln /2 jmod (t + 1) The codes in [4], [8], and [29] all reach the bounds, i.e

  • New bounds and constructions for error control codes

    Creator:
    Al-Darwish, Nasir Ali
    Abstract:
    The bulk of the theory on error control codes has been developed under the fault assumption of random (symmetric) errors, where 1 → 0 and 0 → 1 errors are equally likely. In the past few years, several applications have emerged in which the observed errors are highly asymmetric. This...
    Resource Type:
    Dissertation
    Full Text:
    let 13 A(n,d,w) denote the maximum number of codewords in a binary code of length n, distance d

  • Design and analysis of robust algorithms for fault tolerant computing

    Creator:
    Jang, Jai Eun
    Resource Type:
    Dissertation
    Full Text:
    Appendix A : AAEMC when n=12 & w=3 129 Appendix B : AAEMC when n=12 & w=3 130 LIST OF FIGURES Figure

  • Balanced codes

    Creator:
    Al-Bassam, Sulaiman
    Abstract:
    Balanced codes, in which each codeword contains equally many 1's and 0's, are useful in such applications as in optical transmission and optical recording. When balanced codes are used, the same number of 1's and 0's pass through the channel after the transmission of every word, so the channel is...
    Resource Type:
    Dissertation
    Full Text:
    (Ct,w) 66 Chapter 5 Extensions of Balanced Codes 72 5.1 Balanced Codes with Low DC Levels 72 5.2

  • Concurrent error detection

    Creator:
    Gorshe, Steven Scott
    Abstract:
    Concurrent error detection (CED) is the detection of errors or faults in a circuit or data path concurrent with normal operation of that circuit. The general approach for CED is to calculate a check symbol for the inputs to the circuit under operation, predict the check symbol that will result...
    Resource Type:
    Dissertation

  • Resource placement, data rearrangement, and Hamiltonian cycles in torus networks

    Creator:
    Bae, Myung Mun
    Abstract:
    Many parallel machines, both commercial and experimental, have been/are being designed with toroidal interconnection networks. For a given number of nodes, the torus has a relatively larger diameter, but better cost/performance tradeoffs, such as higher channel bandwidth, and lower node degree, when compared to the hypercube. Thus, the torus is...
    Resource Type:
    Dissertation
    Full Text:
    H1 and 112 is defined as H1 0 H -W H2 ="-­ 0 H2 where elements in H1 and H2 are over Zki and 422