Designing lexicographic codes with a given trellis complexity
Ari Trachtenberg · IEEE Transactions on Information Theory · 2002
We generalize constructions of lexicographic codes to produce locally optimal codes with a desired trellis decoding complexity. These constructions are efficient for high-rate codes and provide a means for automated code design. As a byproduct, we improve known bounds on the parameters of lexicodes.