We may inquire into the possibility of undisclosed errors occurring in the transmittal of the sequence:
Invoking the theorem established in sections 4 and 5, and formulated at the close of section 5, we may assert:
 (1) If not more than three errors are made in transmitting the fifteen letters of the sequence, and if the errors made affect the only, the being correctly transmitted, then the presence of error is certain to be disclosed.

(2) If not more than three errors are made, all told, but at least three of them affect the , then the presence of error will enjoy only a
chance of escaping disclosure.
These assertions result at once from the theorem referred to. But a closer study of the reference matrix employed in this example permits us to replace them by the following more satisfactory statements:

(1′)
If errors occur in not more than three of the fifteen elements of the sequence , and if at least one of the particular elements is correctly transmitted, the presence of error will certainly be disclosed. But if exactly three errors are made, affecting presicely the elements , the presence of error will enjoy a in (in) chance of escaping disclosure. 
(2′)
If more than three errors are made, then whatever the distribution of errors among the fifteen elements of the sequence, the presence of error will enjoy only a
in (in) chance of escaping disclosure.
Assertions of this kind will be carefully established below, when a more important finite field is under consideration. The argument then made will be applicable in the case of any finite field. But it is worthwhile here to look more carefully into the exceptional distribution of errors which is italicized in (1′). This will help us note any weakness that ought to be avoided in the construction of reference matrices.
Suppose that exactly three errors are made, affecting precisely . If the mutilated message is to check up, and the errors to escape disclosure, we must have (for error notations, see sections 4,5):
These equations may be written:
But can be written , or .
Etc. In this way, we find that the errors can escape disclosure if and only if
The error can be made quite arbitrarily. But then the values of and are then completely determined. There is evidently a in chance – and no more – that the errors will fall out just right.
The trouble arises from the vanishing, in our reference matrix, of the tworowed
determinant
Note that
since .
From the fact that is the only vanishing determinant of any order in the matrix employed, all other assertions made in (1′) and (2′) are readily justified. This will be made clear in the following sections.
It will be advantageous, as shown more completely in subsequent sections, to employ reference matrices which contain the smallest possible number of vanishing determinants of any orders.