An (r, , )-locally decodable code encodes a k-bit message x to an N-bit codeword C(x), such that for every i [k], the i-th message bit can be recovered with probability 1 - , by ...
In this paper we propose the gradient match fractal vector quantizers (GMFVQs) and the side match fractal vector quantizers (SMFVQs), which are two classes of finite state fractal...
FingerCode is a fingerprint correlation matching scheme that relies on texture information. In this scheme, the oriented components are extracted from a fingerprint image using a ...
We present here design techniques for trellis-coded vector quantizers with symmetric codebooks that facilitate lowcomplexity quantization as well as partitioning into equiprobable ...
In this paper we consider the problem of searching for the best match for an input among a set of vectors, according to some predetermined metric. Examples of this problem include...