We study several high-rate LDPC codes derived from partial and semipartial geometries.We study in particular the minimum distance of several known infi nite classes of these partial and semipartial and we improve the known bounds on this minimum distance in the binary and non-binary case. In some cases, we can determine the exact minimum distance.