Correcting a specified set of likely error patterns

This paper investigates the problem of finding the minimum redundancy code that will correct any specified set of error patterns which can occur anywhere within a code word or overlap two code words. Suppose a set of likely error patterns in a communication system is given. Although codes which have been designed to correct random error patterns and burst error patterns can be used, the main concern here is to find linear block codes which will correct this set of error patterns with the fewest possible redundant bits for different code wordlengths