Results 221 to 230 of about 95,708 (262)

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   +2 more sources

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

On the Eigenvalues of Hamming Matrix and Hamming Energy of a Graph

Creative Mathematics and Informatics
Let G be a graph with n vertices and m edges. Let V(G) = {v1,v2,...,vn} be the vertex set of G. Thestring s(vi) is the row in the incidence matrix of G corresponding to the vertex vi, which is an m-tuple in Zm 2 . The Hamming matrix H(G) = [hij] of a graph G is an n×nmatrix, whose (i,j)-th entry is the Hamming distance between the strings s(vi) and
HARISHCHANDRA S. RAMANE, T. SHIVAPRASAD, SHEENA Y. CHOWRI   +2 more
openaire   +1 more source

Hamming-Codes und erweiterte Hamming-Codes

1991
Nach Satz 11.5c kann man einen 1-fehlerkorrigierenden binaren Code konstruieren, indem man als Kontrollmatrix eine Matrix mit paarweise verschiedenen Spalten ungleich 0 nimmt. Wir behandeln nun den Fall mit maximaler Spaltenzahl n bei gegebener Zeilenzahl r (- dabei ist r = n – k die Anzahl der Paritatskontrollen). Es existieren genau n = 2 r – 1 von 0
openaire   +1 more source

LC-MS/MS-based metabolomics and sensory evaluation characterize metabolites and texture of normal and spoiled dry-cured hams

Food Chemistry, 2022
Yangying Sun, Jinxuan Cao, Changyu Zhou
exaly  

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

Ham: Cooked Ham

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

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   +2 more sources

Discovery of specific antioxidant peptide from Chinese Dahe black pig and hybrid pig dry-cured hams based on peptidomics strategy

Food Research International, 2023
Yanan Shi, Aixiang Huang, Daodian Wang
exaly