Graph covering index assignment in vector quantisation for noisy channels

An index assignment algorithm is presented for vector quantisation coding on noisy channels. The graph covering heuristic requires an enumeration of hypercube connections, for which a constructive procedure is provided. Experimental results for Gauss-Markov sources show that the proposed method provides more reduction in channel distortion than existing techniques