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 34 for “"Hamming distance"”.
-
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 …
-
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 …
-
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 …
-
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.
-
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 …
-
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 …
-
Studies of active information in search.
… are the location of a hidden string using a hamming distance, the encoding of a binary string using a perceptron, and developing programs using nand gates. In all of these cases, it is shown that the search processes work by making use of problem specific information. In addition, the …
-
Topics in Coding Theory: 1. The A(,s)(n,d) Problem in The Plotkin Region. 2. Number of Information Symbols in a Bch Code
… with s symbols that has length n and minimum Hamming distance d. The Plotkin Region is the set of n and d such that sd > t(s - 1)n. We define Generalized Hadamard matrices, using a notion of orthogonality over a group, and show that these matrices give rise to certain A(,s)(n,d) codes. Two …
-
Quantitative Approaches to the Study of Russian Dialects
… more than one million data points. Linguistic distances between survey sites are calculated using a recursive normalized variant of the Hamming distance and are subsequently analyzed through hierarchical clustering. After evaluating several clustering methods and validation measures, the study …
-
Design and testing of a real time simulation for Trellis Coded Modulation
… soft decision decoding, based on euclidean distance, rather than hard decision decoding, based on hamming distance, is used. Ungerboeck developed a mapping of encoder bits to channel signals on a constellation diagram. The mapping is called mapping by set partitioning and aims to find the …
-
Learning a Family of Detectors
… can be constructed with a proper foreground distance/similarity measure. Detector training is accomplished via standard Support Vector Machine learning. The resulting detectors are tuned to specific variations in the foreground class. They also serve to evaluate hypotheses of the foreground …
-
Hash code learning for large scale similarity search
… bit allocation strategy seamlessly converts the Hamming distance between hash codes into a likelihood ratio test statistic, which is the optimal decision rule to decide if samples are related. We show via experiments that at the same false positive rate, the proposed method could obtain false …
-
Perfect binary codes: classification and properties
… that for any word, there is a unique codeword at Hamming distance at most r. Such a code is r-error-correcting. Two codes are equivalent if one can be obtained from the other by permuting the coordinates and adding a constant vector. The main result of this thesis is a computer-aided …
-
Iterative decoding for rate adaptive forward error correction on the mobile satellite channel.
… through the asymptotic coding gain, the minimum Hamming distance of the code and with information theory arguments. Computer simulations have been run to confirm the validity of the design rules and to determine the impact of the interleaver size on the performance of a coded modulation scheme. A …
-
Space compactor design for built-in self-testing of VLSI circuits from compact test sets using sequence characterization and failure probabilities.
… technique utilizes the concepts of the Hamming distance and sequence weight, together with the use of failure probabilities of the errors in the selection of specific gates for merger of a pair of output streams from the CUT. The outputs coming out of the space compactor may eventually …
-
Learning task-specific similarity
… is commonly defined in terms of a conventional distance function, but such a definition does not necessarily capture the inherent meaning of similarity, which tends to depend on the underlying task. We develop an algorithmic approach to learning similarity from examples of what objects are …
-
A theoretical study of complementary binary code sequences and a computer search for new kernels.
… codes are proved through the use of the Hamming distance concept. Many more invariant properties of the sequences are demonstrated through the introduction of a Hamming vector. The concept of a Hamming vector is extremely useful as a complementary code decomposition tool. A large number …
-
Robust hardware elements for weightless artificial neural networks
… are compared with the traditional Hamming distance metric. This led to the proposal that neuroram can form a threshold logic based digital signal filter. Two weightless autoassociative memory based neuro-filters are presented and their filtration properties studied and compared with …
-
On the Design of Turbo Codes
… are considered: (1) code properties, in terms of Hamming distance spectra, and (2) decoding properties, in terms of the performance of iterative decoding. It is asserted that both these aspects are influenced by both the choice of interleaver and the choice of constituent encoders. An interleaver …
-
Approximate nearest neighbor problem in high dimensions
… and has 0 (nl/c + mn⁰(l)) query time' when the distance between two strings is the Hamming distance. These bounds essentially match the earlier bounds of [12], which assumed that the pattern length m is fixed in advance. Furthermore, our data structure can be constructed in O (n1+1/c + …
Page 1 of 2