A new concatenated BCH-matrix type-B code (Q1112010)

This paper deals with a general case of a new concatenated code obtained from the combination of BCH and matrix type codes which are designed for real compound channels with memory. One investigates the behavior, first of the BCH characteristic polynomial, second, of the matrix type codes with respect to their constraints, and third, of the combination of the two categories of these codes. For the BCH-matrix type-B concatenated code, the author gives the mathematical construction of this code and the decoding algorithm and compares combination codes with BCH and matrix codes. By a numerical example, the author gives statistical parameters of the code. He concludes that the code corrects errors and/or bursts of errors. One presents the main properties of the new code and the corrections concerned with these codes: common error correction (with examples), overlapping error corretion, no common error correction (with examples) and estimation of the relative frequency with which the tree types of error classes can occur. One concludes that implementation of the new concatenated code can be given only in Forney's sense with the BCH code, as an inner, and the matrix code as an outer code.