Results 241 to 250 of about 74,857 (256)
Some of the next articles are maybe not open access.
Hamming distance spectra of turbo-codes
Annales Des Télécommunications, 1995This paper is intended to predict the performance of turbo-codes by analytical means. After a brief description of turbo-codes, the concept of basic return-to-zero (rtz) sequences is introduced. Then, it is shown how rtz sequences can be used to compute the Hamming distance spectrum (uds) via a modified version of the Fano algorithm.
Robert Podemski +3 more
openaire +1 more source
Fuzzy Hamming Distance Based Banknote Validator
The 14th IEEE International Conference on Fuzzy Systems, 2005. FUZZ '05., 2005Banknote validation systems are used to discriminate between genuine and counterfeit banknotes. The paper proposes a one-class classifier for genuine class using a new similarity measure based on the fuzzy Hamming distance. For each banknote several regions are considered (corresponding to security features) and each region is split in m times n ...
M. Ionescu, A. Ralescu
openaire +1 more source
Large scale Hamming distance query processing
2011 IEEE 27th International Conference on Data Engineering, 2011Hamming distance has been widely used in many application domains, such as near-duplicate detection and pattern recognition. We study Hamming distance range query problems, where the goal is to find all strings in a database that are within a Hamming distance bound k from a query string.
Alex X. Liu, Ke Shen, Eric Torng
openaire +1 more source
Colorings of Hamming-Distance Graphs
2017Hamming-distance graphs arise naturally in the study of error-correcting codes and have been utilized by several authors to provide new proofs for (and in some cases improve) known bounds on the size of block codes. We study various standard graph properties of the Hamming-distance graphs with special emphasis placed on the chromatic number.
openaire +1 more source
Clustering categorical data via Hamming distance
2021Clustering methods have typically found their application when dealing with continuous data. However, in many modern applications data consist of multiple categorical variables with no natural ordering. In the heuristic framework the problem of clustering these data is tackled by introducing suitable distances.
Edoardo Filippi-Mazzola +2 more
openaire +2 more sources
Anonymized Distance Filter in Hamming Space
2016Search algorithms typically involve intensive distance computations and comparisons. In privacy-aware applications such as biometric identification, exposing the distance information may lead to compromise of sensitive data that have privacy and security implications.
Yi Wang +3 more
openaire +1 more source
A Compressed Index for Hamming Distances
2014Some instances of multimedia data can be represented as high dimensional binary vectors under the hamming distance. The standard index used to handle queries is Locality Sensitive Hashing (LSH), reducing approximate queries to a set of exact searches.
Francisco Santoyo +2 more
openaire +1 more source