Translation schemes and LP bounds

Abstract

We summarize some results and concepts regarding translation schemes in hope of making such topic more accessible. Two subclasses of translation schemes are of particular interest, namely, the ordered and unordered extension schemes. A linear programming (LP) bound for translation schemes is discussed. Specifying the translation scheme as the ordered extension of the one-class translation scheme, such LP bound reduces to the recently derived LP bound of Chan et al. based on the notion of support enumerator.