Abstract:
This article discribes different characteristics of proximity specifications $k$-value function. Most of the authors consider characteristics of proximity specifications in boolean case as Hamming distance only, but we can suggest several different approaches to definitions of this terms. The solution to this problem will allow to expand the number of methods for analysis and building information processing and security data system.
