Inverse maximum flow (IMDF), is among the most important problems in the field ofdynamic network flow, which has been considered the Euclidean norms measure in previousresearches. However, recent studies have mainly focused on the inverse problems under theHamming distance measure due to their practical and important applications. In this paper,we studies a general approach for handling the inv...

Scalable image search based on visual similarity has been an active topic of research in recent years. State-of-the-art solutions often use hashing methods to embed high-dimensional image features into Hamming space, where search can be performed in real-time based on Hamming distance of compact hash codes. Unlike traditional metrics (e.g., Euclidean) that offer continuous distances, the Hammin...

— The relationship between entropie distance, entropie measure of connexion or interdependence and Hamming distance is investigated. Some applications to the classification ofthe families of curves are also given. Résumé. — On étudie la relation entre la distance entropique, la mesure entropique de connexion ou interdépendance et la distance de Hamming, avec quelques applications à la classific...

A finite ring R and a weight w on R satisfy the Extension Property if every R linear w -isometry between two R -linear codes in R extends to a monomial transformation of R n that preserves w . MacWilliams proved that finite fields with the Hamming weight satisfy the Extension Property. It is known that finite Frobenius rings with either the Hamming weight or the homogeneous weight satisfy the E...

In this paper, Harris Corner Detector is proposed as a corner detection technique to extract palmprint features in the form of corners. Here, hamming distance similarity measurement using sliding window method is used as a feature matching method for the corners detected. The aim of using hamming distance method for corner matching is the non-dependency of the method with the number of corners ...