In this paper, we propose a construction of fullrank q-ary 1-perfect codes over finite fields. This construction is a generalization of the Etzion and Vardy construction of fullrank binary 1-perfect codes (1994). Properties of i-components of q-ary Hamming codes are investigated and the construction of full-rank q-ary 1-perfect codes is based on these properties. The switching construction of 1...

The maximum number of edges spanned by a subset of given diameter in a Hamming space with alphabet size at least three is determined. The binary case was solved earlier by Ahlswede and Khachatrian [A diametric theorem for edges, J. Combin. Theory Ser. A 92(1) (2000) 1–16]. © 2007 Elsevier B.V. All rights reserved.

where / ^ 0, F is a proper subset of {1, 2, . . . , n) and the symbol 1_ is used for "exclusive or": i JL j £ V means i G V, j £ V or i (? V,j(z V. The metrics (2) are extreme rays of the metric cone and are called Hamming rays. The convex hull of these rays is called the Hamming cone Hn and we call d Hamming, if d Ç Hn. Such metrics are also called L-embeddable (e.g., [2]) or addressable (e.g....

In this paper, Harris Corner Detector is proposed as a corner detection technique to extract palmprint features in the form of corners. Here, hamming distance similarity measurement using sliding window method is used as a feature matching method for the corners detected. The aim of using hamming distance method for corner matching is the non-dependency of the method with the number of corners ...

Providing sequence tagging that minimize Hamming loss is a challenging, but important, task. Directly minimizing this loss over a training sample is generally an NP-hard problem. Instead, existing sequence tagging methods minimize a convex upper bound that upper bounds the Hamming loss. Unfortunately, this often either leads to inconsistent predictors (e.g., max-margin methods) or predictions t...

We study the Hamming distance from polynomials to classes of polynomials that share certain properties of irreducible polynomials. The results give insight into whether or not irreducible polynomials can be effectively modeled by these more general classes of polynomials. For example, we prove that the number of degree n polynomials of Hamming distance one from a randomly chosen set of b2n/nc o...

Frequency hopping sequences (FHSs) with favorable partial Hamming correlation properties have important applications in many synchronization and multiple-access systems. In this paper, we investigate constructions of FHS sets with optimal partial Hamming correlation. We present several direct constructions for balanced nested cyclic difference packings (BNCDPs) and balanced nested cyclic relati...