Robust indexing of lattices and permutation codes over binary symmetric channels

In this paper we develop two families of indexing methods for permutation codes and lattices, the lexicographical and binomial indexing families. The parameters of a method within a family can be optimized with respect to a given criterion in order to obtain a good indexing method on the considered set of vectors to be indexed. The proposed indexing methods can be straightforwardly applied for error resilient coding, but also to other applications as e.g. the magnetic recording which is based on (d,k) constrained codes. We have tested the performance of the proposed method at the optimization of the indexing method of a codebook with respect to the channel distortion for several types of lattices and other structured vector quantizers over binary symmetric channels. (C) 2003 Elsevier Science B.V. All rights reserved.