The iris is currently believed to be the most accurate biometric for human identification. The majority of fielded iris identification systems are based on the highly accurate wavelet-based Daugman algorithm. Another promising recognition algorithm by Ives et al uses Directional Energy features to create the iris template. Both algorithms use Hamming distance to compare a new template to a stor...

We derive theoretical upper and lower bounds on the maximum size of DNA codes of length n with constant GC-content w and minimum Hamming distance d, both with and without the additional constraint that the minimum Hamming distance between any codeword and the reverse-complement of any codeword be at least d. We also explicitly construct codes that are larger than the best previously-published c...

The diversity and scope of multiplex parallel sequencing applications is steadily increasing. Critically, multiplex parallel sequencing applications methods rely on the use of barcoded primers for sample identification, and the quality of the barcodes directly impacts the quality of the resulting sequence data. Inspection of the recent publications reveals a surprisingly variable quality of the...

A classical bidirectional associative memory (BAM) suffers from low storage capacity and abundance of spurious memories though it has the properties of good generalization and noise immunity. In this paper, Hamming distance in recall procedure of usual asymmetrical BAM is replaced with modified Hamming distance by introducing weighting matrix into connection matrix. This generalization is valid...

Abstract. In this paper we present the fuzzy shortest path and shortest path length with Type-2 fuzzy number. To solve this problem we proposed an algorithm from a specified node to other nodes in a network and we have compared the results with other distance measures like Hamming, Normalized Hamming, Exponential type distance measures also. Our proposed algorithm is illustrated with the help o...

A promising way to accelerate similarity search is semantic hashing which designs compact binary codes for a large number of documents so that semantically similar documents are mapped to similar codes within a short Hamming distance. In this paper, we introduce the novel problem of co-hashing where both documents and terms are hashed simultaneously according to their semantic similarities. Fur...

We obtain a non-implication result in the Medvedev degrees by studying sequences that are close to Martin-Löf random in asymptotic Hamming distance. Our result is that the class of stochastically bi-immune sets is not Medvedev reducible to the class of sets having complex packing dimension 1.

In the gap Hamming distance problem, two parties must determine whether their respective strings x; y 2 f0; 1g are at Hamming distance less than n=2 p n or greater than n=2 C p n: In a recent tour de force, Chakrabarti and Regev (STOC ’11) proved the long-conjectured ̋.n/ bound on the randomized communication complexity of this problem. In follow-up work several months ago, Vidick (2010; ECCC T...

This paper presents an analysis of a two-level decoupled Hamming network, which is a high performance discrete-time/discrete-state associative memory model. The two-level Hamming memory generalizes the Hamming memory by providing for local Hamming distance computations in the first level and a voting mechanism in the second level. In this paper, we study the effect of system dimension, window s...

We study constacyclic codes, of length np and 2np, that are generated by the polynomials (x+γ) and (x−ξ)(x+ξ) respectively, where x+γ, x−ξ and x+ξ are irreducible over the alphabet Fpa . We generalize the results of [5], [6] and [7] by computing the minimum Hamming distance of these codes. As a particular case, we determine the minimum Hamming distance of cyclic and negacyclic codes, of length ...