Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 20 of 150 for “"Hamming Distance"”.

  1. Efficient similarity search with hamming distance constraints

    In this thesis, we study the Hamming distance query problem. Hamming distance measures the number of dimensions where two vectors have different values. In applications such as pattern recognition, information retrieval, Chemoinformatics and databases, it is often needed to perform efficient …

    unsw Repository record for Efficient similarity search with hamming distance constraints (opens in a new tab)

  2. Settling the complexity of the k-disjointness and the k-Hamming distance problems

    … complexity of two related problems, the $k$-Hamming distance and $k$-disjointness and give tight bounds to both of these problems: The $r$-round communication complexity of the $k$-disjointness problem is $\Theta(k\log^{(r)}k)$, whereas a tight $\Omega(k\log k)$ bound holds for the …

    washington Repository record for Settling the complexity of the k-disjointness and the k-Hamming distance problems (opens in a new tab)

  3. Hamming distance as a metric for the detection of side channel in 802.11 wireless communications

    … drop erroneous frames. A metric called the Hamming Distance (HD) was proposed for detection which distinguishes legitimate from illegitimate errors. The idea is to apply this HD measure to compare CRC values that are generated by different CRC polynomials. The hypothesis is that the average …

    uoit Repository record for Hamming distance as a metric for the detection of side channel in 802.11 wireless communications (opens in a new tab)

  4. Detection of side-channel communication in a mobile ad-hoc network environment using the Hamming distance metric

    … to those who are not the intended recipient. A Hamming Distance (HD) difference between the FCS values of purposely corrupted and naturally corrupted frames is proposed as a metric for the detection of side channel communication. In theory, it should be possible to recognize purposely corrupted …

    uoit Repository record for Detection of side-channel communication in a mobile ad-hoc network environment using the Hamming distance metric (opens in a new tab)

  5. Quality of iris segmentation as a predictor of verification performance

    … (PCA) is performed. The resulting pairwise distances between the genuine pairs are compared to the hamming distance scores of the iris templates. The relationship between the two samples will be examined, and curve fitting by least squares regression is shown to be an adequate method of …

    wvu Repository record for Quality of iris segmentation as a predictor of verification performance (opens in a new tab)

  6. A Study Of Linear Error Correcting Codes

    … which aims at designing codes with large minimum Hamming distance and probabilistic coding which places the emphasis on low complexity probabilistic decoding using long codes built from simple constituent codes. This work presents some further investigations in these two channel coding development …

    plymouth Repository record for A Study Of Linear Error Correcting Codes (opens in a new tab)

  7. Neural networks with categorical valued inputs and applications to intrusion detection

    … of the categorical values. One such metric is Hamming distance. The applicability of Hamming distance for neural networks has not adequately been studied. This work fills the gap and shows that probabilistic neural networks using Hamming distance with categorical inputs retain their asymptotic …

    must-thes Repository record for Neural networks with categorical valued inputs and applications to intrusion detection (opens in a new tab)

  8. Genetic Algorithm Stream Cipher Key Generation Using NIST Functions

    … These keys were evaluated by using the Hamming distance between the keys and time that it took for key generation. After each individual fitness function was evaluated, two combinations of five tests were created and used as a single fitness function. The two combinations were the best …

    ecu Repository record for Genetic Algorithm Stream Cipher Key Generation Using NIST Functions (opens in a new tab)

  9. MEASURES AND ALGORITHMS FOR THE EXACT SATISFIABILITY PROBLEM AND ITS VARIANTS

    … problems (Decision), #X3SAT (Counting), Max Hamming Distance XSAT and Max Hamming Distance X3SAT (Optimization problems). These problems are at least NP-hard. We propose faster exact algorithms to solve these problems, beating the current state of the art algorithms. We either design a new …

    nus Repository record for MEASURES AND ALGORITHMS FOR THE EXACT SATISFIABILITY PROBLEM AND ITS VARIANTS (opens in a new tab) Download file for MEASURES AND ALGORITHMS FOR THE EXACT SATISFIABILITY PROBLEM AND ITS VARIANTS (opens in a new tab)

  10. Physically Unclonable Functions based on Voltage Divider Arrays of MOSFETs in Subthreshold Region of Operation

    … 0.48pJ/bit of energy only. The measured inter hamming distance is 0.4982 and intra hamming distance is 0.0225. The circuits are designed in TSMC 65nm technology using Cadence software and the computations and interpretations is done using MATLAB.

    buffalo Repository record for Physically Unclonable Functions based on Voltage Divider Arrays of MOSFETs in Subthreshold Region of Operation (opens in a new tab)

  11. Efficient processing of similarity queries with applications

    … we study how to efficiently process Hamming-distance-based similarity queries (Hamming-distance select and Hamming-distance join) that are crucial to many applications. We introduce a new index, termed the HA-Index, that speeds up distance comparisons and eliminates redundancies when …

    purdue-thes Repository record for Efficient processing of similarity queries with applications (opens in a new tab)

  12. Index Assignment for Robust Multiple Description Scalar Quantizer

    … in each description to increase a minimum Hamming distance-like performance measure.</p> <p>The criterion of increasing the minimum Hamming distance between valid index pairs (d<sub>min</sub>), has been considered in prior work, however an efficient IA construction was presented only for …

    mcmaster Repository record for Index Assignment for Robust Multiple Description Scalar Quantizer (opens in a new tab)

  13. A new distance-based algorithm for block turbo codes : from concept to implementation

    … outputs are generated based on the Euclidean distance property of decision code words. More importantly, such algorithm has very low computational complexity and is very attractive for practical applications. Based on the synthesis result of FPGA (Field Programmable Gate Array) implementations …

    concordia Download PDF for A new distance-based algorithm for block turbo codes : from concept to implementation (opens in a new tab)

  14. Finding Hadamard and (epsilon,delta)-Quasi-Hadamard Matrices with Optimization Techniques

    … to prove non-trivial lower bounds on the Hamming distance between any given matrix with elements in {+1,-1} and the set of Hadamard matrices, then we use this algorithm to study matrices with similar properties to Hadamard matrices, but which are far away (with respect to the Hamming …

    ottawa-retro Repository record for Finding Hadamard and (epsilon,delta)-Quasi-Hadamard Matrices with Optimization Techniques (opens in a new tab)

  15. Asymmetric Encryption for Wiretap Channels

    … a good (BEqC), [n; k] code. The highest minimum Hamming distance of a linear code is an important parameter which indicates the capability of detecting and correcting errors by the code. In general, (BEqC) have a respectable minimum Hamming distance, but are sometimes not as good as the best …

    plymouth Repository record for Asymmetric Encryption for Wiretap Channels (opens in a new tab)

  16. Quantifying Noise Effects in Bilevel Document Images

    … between noise spread and the expected Hamming distance between an image with noise added and the same image without noise added. It is also known that if two images of an object are synthetically generated with independent random phases and zero noise, there is a small Hamming distance …

    boise Repository record for Quantifying Noise Effects in Bilevel Document Images (opens in a new tab)

  17. INDEX MAPPING FOR ROBUST MULTIPLE DESCRIPTION LATTICE VECTOR QUANTIZER

    … second approach attempts to increase the minimum Hamming distance between possible indexes in the second description when the first description is fixed. This is achieved using a structured construction as follows. First the set of second description side lattice points is partitioned into Voronoi …

    mcmaster Repository record for INDEX MAPPING FOR ROBUST MULTIPLE DESCRIPTION LATTICE VECTOR QUANTIZER (opens in a new tab)

  18. Classification of small optimal linear codes over Z₄

    … of Z4 linear codes for lengths up to 7. Three distance metrics are considered, Lee distance, Hamming distance and Euclidean distance. The inequivalent codes are determined from the optimal codes constructed. Self-orthogonal codes, self-dual codes, isodual codes, formally self-dual codes and …

    uvic Repository record for Classification of small optimal linear codes over Z₄ (opens in a new tab)

Page 1 of 8