The rationale behind was identified to be the indefinite discrete-to-binary mapping behavior during the discretization process, since the employment of an encoding scheme in general affects only on how each index of the quantization intervals is mapped to a unique binary codeword.
Due to quantization, each distinct (tilde {u}_{t} k)) can be mapped (entropy coded) to a unique bit stream (codeword), say b t (k).
For binary extraction, biometric discretization can be described as a two-stage mapping process: Each segmented feature space is first mapped to the respective index of a quantization interval; subsequently, the index of each interval is mapped to a unique n-bit codeword in a Hamming space.
Encoding: The second component can be regarded as a discrete-to-binary mapping process, where the resultant index of each dimension is mapped to a unique n-bit binary codeword of an encoding scheme.
As shown in Figure 2c, LSSC links each of its codewords to a unique Hamming distance away from any reference codeword in a decent manner.
We can observe clearly from Figure 2 that even though the widely used DBR and BRGC have each of their codewords associated with a unique index, most mapped elements eventually overlap each other as far as Hamming distance is concerned.
It should be noted that each codeword X ij uses a unique antenna mapping pattern.
components drawn according to the marginal P X D | U r, U, S D. Meanwhile, to send a message w R(k) ∈ [1, 2 nR ], express it as a unique set of messages m s R k : s R ∈ S R. The source, knowing the codeword u r n w R k − 1, j r k, considers the set of codewords x R n m s R k | s R, w R k − 1, j r k : s R ∈ S R. Store each codeword in a first-in-first-out (FIFO) buffer of length n.
components drawn according to the marginal P X D | U r, U, S D. (iii) Meanwhile, to send a message w R(k) ∈ [1, 2 nR ], express it as a unique set of messages m s R k : s R ∈ S R. The source, knowing the codeword u r n w R k − 1, j r k, considers the set of codewords x R n m s R k | s R, w R k − 1, j r k : s R ∈ S R. Store each codeword in a first-in-first-out (FIFO) buffer of length n.
