The orthogonal time frequency space (OTFS) modulation technique can provide reliable communication in time-varying channels. Due to the dispersive characteristics of underwater acoustic channels, this paper proposes an OTFS-IM system based on Hamming distance optimization reduce impact dispersion communication. Firstly, is introduced, which introduces index into Delay–Doppler (DD) domain make O...

This paper presents a new decoding for polynomial residue codes, called the minimum degree-weighted distance decoding. The newly proposed decoding is based on the degreeweighted distance and different from the traditional minimum Hamming distance decoding. It is shown that for the two types of minimum distance decoders, i.e., the minimum degree-weighted distance decoding and the minimum Hamming...

Role-based Access Control has become the standard of practice for many organizations restricting control on limited resources in complicated infrastructures or systems. The main objective role mining development is to define appropriate roles that can be applied specified security access policies. However, scales this kind setting are extensive and cause a huge load management To resolve above ...

We present a novel quantum algorithm to evaluate the hamming distance between two unknown oracles via measuring degree of entanglement ancillary qubits. In particular, we use power based computing model that preserves at most locality interactions within structure. This uses one techniques retrieve solution problem hand. first technique, is obtained on whether there an qubits or not. second, as...

Graham and Winkler derived a formula for the determinant of distance matrix full-dimensional set n + 1 points { x 0 , … } in Hamming cube H = ( ? ) . In this article we derive D an arbitrary m It follows from more general that det ? if only vectors are affinely independent. Specializing to case provides new insights into original Winkler. A significant difference arises between cases < is noted...

We prove a version of the Ray-Chaudhuri{Wilson and Frankl-Wilson theorems for kwise intersections and also generalize a classical code-theoretic result of Delsarte for k-wise Hamming distances. A set of code-words a1; a2; : : : ; ak of length n have k-wise Hamming-distance `, if there are exactly ` such coordinates, where not all of their coordinates coincide (alternatively, exactly n ` of thei...

A Hamming compatible metric is an integer-valued metric on the words of a finite alphabet which agrees with the usual Hamming distance for words of equal length. We define a new Hamming compatible metric, compute the cardinality of a sphere with respect to this metric, and show this metric is minimal in the class of all “well-behaved” Hamming compatible metrics.

The Hamming distance is commonly used in the segmentation literature to measure the pixel-wise difference between two binary maps where 0 implies the two completely overlap. Here, we employ the Hamming distance metric to measure both the pixel-level accuracy and confidence of each pixel (close to 0 or 1). The smaller the Hamming distance, the more accurate is the model. In addition, we also com...

Computing genetic evolution distances among a set of taxa dominates the running time of many phylogenetic inference methods. Most of genetic evolution distance definitions rely, even if indirectly, on computing the pairwise Hamming distance among sequences or profiles. We propose here an average-case linear-time algorithm to compute pairwise Hamming distances among a set of taxa under a given H...