Performance of a powerful error-correcting and -detecting coding scheme for the North American Basic Teletext System (NABTS) for random independent errors: methods, equations, calculations and results

For a powerful layered, upward- and downward-compatible error-correcting and error-detecting scheme for NABTS, various bit error rate (BER) related performance measures are derived and calculated for random independent errors. The methods, equations, calculations and results are given for the least powerful one-byte suffix codes, for the two-byte suffix code, called code C, and for the double and single bundle codes formed by using code C for each data block (i.e. horizontally) and also vertically, thus forming a product code, for a specified, but variable, number of data blocks. Performance bounds and equations for probabilities of correct decoding of error and of decoding failure are given. The weight enumerators for a number of one-byte suffix codes are calculated, and those of weight four are classified into types depending on the number of ones occurring in a byte, and in other arrangements. Performance analyses and comparisons with a code for Japanese teletext are included. Analyses used in computer simulation studies are described