Error-locating codes, first proposed by J.~K. Wolf and B. Elspas, are used in fault diagnosis in computer systems and reduction of the retransmission cost in communication systems. This paper presents locating codes obtained from the famous Extended $(8, 4)$ Hamming code capable of identifying the sub-block that contains solid burst errors of length $2$ (or $3$) or less. We also make a comparison of information rate between the extended Hamming code and obtained codes. Further, comparisons in solid burst error detection and location probabilities of the codes over binary symmetrical channel are also provided.