Search Constraints

Start Over
Filtering by: Creator Every, R. W. Remove constraint Creator: Every, R. W. Advisor Bose, Bella Remove constraint Advisor: Bose, Bella

Search Results

  • Systematic Codes for Correcting Deletion/Insertion of One Zero in Each and Every Bucket of Zeros

    Creator:
    Vu, Hoang
    Abstract:
    In this thesis, we propose a systematic code for correcting t = 1 insertion/deletion errors of the character ”0” that can occur between any two consecutive 1’s in a binary string. The code requires balanced input strings, where each word of length n contains ⌈n/2⌉ 0’s and ⌊n/2⌋ 1’s. This...
    Resource Type:
    Masters Thesis
    Full Text:
    ) + · · ·+ ( w + 1 w ) (2.3) This summation is equivalent to summing up every number in the (w + 1)th row of

  • 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

  • Some contributions to asymmetric error control codes

    Creator:
    Elmougy, Samir
    Abstract:
    In some practical systems, most of the errors are of 1 → 0 type and 0 → 1 errors occur very rarely. In this thesis, first, the capacity of the asymmetric channel is derived. The capacity of the binary symmetric channel (BSC) and the Z-channel can be derived from this...
    Resource Type:
    Dissertation
    Full Text:
    weight w = 128 using type-I hybrid ARQ, R)b(w), and diversity combining scheme, c(w). . . 91

  • On edge disjoint Hamiltonian cycles in torus and Gaussian networks

    Creator:
    Alazemi, Fawaz M.
    Abstract:
    Many algorithms in parallel systems can be easily solved if we can generate a Hamiltonian cycle on the underly network. Finding Hamiltonian cycle is a well known NP-complete problem. For specific instances of regular graphs, such as Torus and Gaussian network, one can easily find Hamiltonian cycles. In this thesis,...
    Resource Type:
    Masters Thesis
    Full Text:
    . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 8 2.2.1 n = 2r EDHC on Tnk where r ≥ 0 and k ≥ 3 . . . . . . . . . . . . 8 2.2.2 EDHC on Gα

  • A token caching waiting-matching unit for tagged-token dataflow computers

    Creator:
    Traylor, Roger L.
    Abstract:
    Computers using the tagged-token dataflow model are among the best candidates for delivering extremely high levels of performance required in the future. Instruction scheduling in these computers is determined by associatively matching data-bearing tokens in a Waiting-Matching Unit (W-M unit). At the W-M unit, incoming tokens with matching contexts are...
    Resource Type:
    Masters Thesis
    Full Text:
    associatively matching data-bearing tokens in a Waiting-Matching Unit (W-M unit). At the W-M unit, incoming

  • 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:
    : number of check bits. n : the length of the code (n = k+r). W(X) : the number of 1's in a binary vector

  • Signed Digit Representation of Numbers

    Creator:
    Venkatachalapathy, Savithri
    Abstract:
    "A non-redundant number system has the digit set limited ranging from 0 to radix -1. While the Signed digit numbers have digit set consisting of more than radix r values. Hence it is also called redundant number system. Furthermore, the advantage of redundant number system lies in its application for...
    Resource Type:
    Capstone Project
    Full Text:
    : w-i X =X w-1, X w-2 ….X 0 = ∑ Xw-i * r i

  • Deletions and Insertions of the Symbol 0 and Asymmetric/Unidirectional Error Control Codes for the L₁ Metric

    Creator:
    Alqwaifly, Nawaf
    Abstract:
    This work gives some theory and efficient design of binary block codes capable of controlling the deletions of the symbol “0” (referred to as 0-deletions) and/or the insertions of the symbol “0” (referred to as 0-insertions). This problem of controlling 0-deletions and/or 0-insertions (referred to as symmetric 0-errors) is shown...
    Resource Type:
    Dissertation
    Full Text:
    over A where every codeword weight is exactly w. A constrained weight w code of length n over the

  • On shortest disjoint paths and Hamiltonian cycles in some interconnection networks

    Creator:
    Hussain, Zaid
    Abstract:
    Parallel processors are classified into two classes: shared-memory multiprocessors and distributed- memory multiprocessors. In the shared-memory system, processors communicate through a common memory unit. However, in the distributed multiprocessor system, each processor has its own memory unit and the communications among the processors are performed through an interconnection network. Thus,...
    Resource Type:
    Dissertation
    Full Text:
    given graph where each node is visited once and returns to the starting node and every edge is in at

  • 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:
    check symbols, it must have some Ci = C . Assume i < j. If WH(Ci) = 0 or W H (C.) = r, then by Theorem