Results 31 to 40 of about 18,476 (288)
Hamming index of graphs with respect to its incidence matrix
Indonesian Journal of Combinatorics, 2022 Let B(G) be the incidence matrix of a graph G. The row in B(G)corresponding to a vertex v, denoted by s(v) is the string which belongs to ℤm2, a set of m-tuples over a field of order two.
Harishchandra S. Ramane +6 more
doaj +1 more source
On Robust Colorings of Hamming-Distance Graphs [PDF]
The Electronic Journal of Combinatorics, 2018 $H_q(n,d)$ is defined as the graph with vertex set $\mathbb{Z}_q^n$ and where two vertices are adjacent if their Hamming distance is at least $d$. The chromatic number of these graphs is presented for various sets of parameters $(q,n,d)$. For the $4$-colorings of the graphs $H_2(n,n-1)$ a notion of robustness is introduced. It is based on the tolerance
Isaiah Harney, Heide Gluesing-Luerssen
openaire +3 more sources
Count-min sketches for estimating password frequency within Hamming distance two [PDF]
, 2013 The count-min sketch is a useful data structure for recording and estimating the frequency of string occurrences, such as passwords, in sub-linear space with high accuracy.
South, Leah +3 more
core +1 more source
Structural Relationship of Isomorphic Graph and its Mapping to Hamming Distance [PDF]
EPJ Web of ConferencesMapping graph isomorphism to Hamming distance enables a simple yet effective approach to quantifying structural similarity. By encoding graphs as binary adjacency vectors—flattened from the upper triangle of the adjacency matrix—structural comparisons ...
Tiwari Monika +3 more
doaj +1 more source
Iraqi Journal for Mechanical and Materials Engineering, 2019 Cell Formation (CF) problem considers as the most important issue in the Cellular Manufacturing (CM) system particularly the design step. CF deals with the creation of machine cells (MCs) and part families (PFs).
Sanaa Ali Hamza, Ammar Jehad
doaj +1 more source
IEEE Access, 2020 In this article, a novel antenna subset selection technique for enhancing the Physical Layer Randomness (PLR) of Antenna Subset Modulation (ASM) has been proposed.
Omar Ansari +4 more
doaj +1 more source
On subsets of the hypercube with prescribed Hamming distances [PDF]
Journal of Combinatorial Theory, Series A, 2020 A celebrated theorem of Kleitman in extremal combinatorics states that a collection of binary vectors in $\{0, 1\}^n$ with diameter $d$ has cardinality at most that of a Hamming ball of radius $d/2$. In this paper, we give an algebraic proof of Kleitman's Theorem, by carefully choosing a pseudo-adjacency matrix for certain Hamming graphs, and applying ...
Hao Huang 0005 +2 more
openaire +3 more sources
Optimization of the fractional Hamming distance threshold. [PDF]
, 2013 Plots for the optimization of the fractional Hamming distance threshold: (A) the average clustering performances (F-measure) vs. fractional Hamming distances, (B) average CPU times (in seconds) vs. fractional Hamming distances.
Bilge Karaçalı (80395) +1 more
core +1 more source
Testing The Accuracy of Fingerprint Recognition using Levenshtein Distance and Hamming Distance Methods : Uji Ketepatan Pengenalan Sidik Jari dengan Metode Levenshtein Distance dan Hamming Distance [PDF]
, 2023 The presence or evidence of attendance is crucial in monitoring the presence of every individual working in a particular field. Developing an employee attendance system using fingerprints can expedite the processing of data of employees who have or have ...
Ginantaka, Gregorius Sakti +2 more
core +2 more sources
Hamming Distance Kernelisation via Topological Quantum Computation [PDF]
, 2017 We present a novel approach to computing Hamming distance and its kernelisation within Topological Quantum Computation. This approach is based on an encoding of two binary strings into a topological Hilbert space, whose inner product yields a natural ...
Windridge, David +7 more
core +4 more sources