Results 21 to 30 of about 62,184 (228)
The intractability of computing the Hamming distance
Theoretical Computer Science, 2003 The Hamming distance of a string \(x\) to a language \(L\) is the minimum Hamming distance of \(x\) to any string in \(L\). The paper presents a number of results on the complexity of computing the Hamming distance. Namely, there exist a language in AC\(^0\) such that both Hamming distance and edit distance to this language are hard to approximate ...
Manthey, Bodo, Reischuk, Rüdiger
openaire +1 more source
Some Connections Between Classical Coding and Network Coding Over Erroneous Cyclic Networks
IEEE Access, 2016 Recently, a framework was given for linear error-correcting network codes (LENCs) over cyclic networks on commutative rings. When the alphabet is considered as a rational power series ring, an LENC is referred to as a convolutional error-correcting ...
Vahid Samadi-Khaftari +2 more
doaj +1 more source
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
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
The streaming $k$-mismatch problem [PDF]
, 2018 We consider the streaming complexity of a fundamental task in approximate pattern matching: the $k$-mismatch problem. It asks to compute Hamming distances between a pattern of length $n$ and all length-$n$ substrings of a text for which the Hamming ...
Clifford, Raphaël +2 more
core +3 more sources
An Optimal Lower Bound on the Communication Complexity of Gap-Hamming-Distance [PDF]
, 2010 We prove an optimal $\Omega(n)$ lower bound on the randomized communication complexity of the much-studied Gap-Hamming-Distance problem. As a consequence, we obtain essentially optimal multi-pass space lower bounds in the data stream model for a number ...
Chakrabarti, Amit, Regev, Oded
core +9 more sources
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
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
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