Codebook Design Problem
Input: A training set X of vectors of dimension d and a number n. (d = a x b and n is number of codewords)
Ouput: n vectors c1, c2, ... cn that minimizes the sum of the distances from each member of the training set to its nearest codeword. That is minimizes where cn(x) is the nearest codeword to x.