The paper considers two-dimensional linear codes with sub-block structure in RT-spaces \([2-5,7]\) whose error location techniques are described in terms of various sub-blocks. Upper and lower-bounds are given for the number of check digits required with any error locating code in RT-spaces.