Results 121 to 130 of about 91,802 (164)

Hamming chromatography

Molecular Diversity, 1996
Selection of molecules with desired properties from random pools of biopolymers has become a powerful tool in biotechnology. On designing an evolution experiment, a certain knowledge of the concomitant fitness landscape is clearly helpful to set up the optimal experimental conditions. The correlation function is a useful means of characterizing a given
A, Schwienhorst, A, Schober, R, Günther, P F, Stadler   +3 more
openaire   +2 more sources

Intersection of Hamming codes avoiding Hamming subcodes

Designs, Codes and Cryptography, 2011
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Josep Rifà, Faina I. Solov'eva, Mercè Villanueva   +2 more
openaire   +2 more sources

Fuzzy hamming distinguishability

2017 IEEE International Conference on Fuzzy Systems (FUZZ-IEEE), 2017
Back in 1967 the Croat linguist Ž. Muljacic had used a fuzzy generalization of the Hamming distance between binary strings to classify Romance languages. In 1956 Cl. Shannon had introduced the notion of codeword distinguishability in zero-error information theory. Distance and distinguishability are subtly different notions, even if, with distances as
Laura Franzoi, Andrea Sgarro
openaire   +2 more sources

Hamming Matrix and Hamming Energy of a Graph

Match Communications in Mathematical and in Computer Chemistry
Hamming distance is a highly valuable quantity in computer science. In this work, we establish the Hamming matrix H of a graph G, H(G). This is a square matrix, where the elements of the H(G) are Hamming distances. Also, we define the Hamming energy of a graph, HE(G), which is a sum of the absolute eigenvalues of H(G).
Nemanja Vučićević, Izudin Redžepović, Nenad Stojanović   +2 more
openaire   +1 more source

On the rank of π1(Ham)

Algebraic & Geometric Topology, 2022
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +2 more sources

Ham

Notes and Queries, 1886
  +7 more sources

Generalized Hamming Distance

Information Retrieval, 2002
Many problems in information retrieval and related fields depend on a reliable measure of the distance or similarity between objects that, most frequently, are represented as vectors. This paper considers vectors of bits. Such data structures implement entities as diverse as bitmaps that indicate the occurrences of terms and bitstrings indicating the ...
Abraham Bookstein, Vladimir A. Kulyukin, Timo Raita   +2 more
openaire   +1 more source

On computing the Hamming distance

Acta Cybern., 2004
Summary: Methods for the fast computation of the Hamming distance developed for the case of a large number of pairs of words are presented and discussed in the paper. The connection of this subject to some questions about intersecting sets and Hadamard designs is also considered.
Gerzson Kéri, Ákos Kisvölcsey
openaire   +2 more sources

Hamming, Permutations and Automata

2007
Quantum finite automata with mixed states are proved to be super-exponentially more concise rather than quantum finite automata with pure states. It was proved earlier by A.Ambainis and R.Freivalds that quantum finite automata with pure states can have exponentially smaller number of states than deterministic finite automata recognizing the same ...
openaire   +1 more source

Ham: Cooked Ham

2016
F. Toldrá, M. Reig
openaire   +1 more source