Abstract
An innovative approach to approximate matching of multi-attribute objects based on reversing the conventional scheme of error-correction coding is presented. With this hashing technique it is possible to construct 'fault-tolerant' indices allowing certain mismatches of binary vectors in terms of Hamming metrics. The developed technique is also beneficial for complex computational procedures incorporating near-matching operations.