  Locally recoverable codes were introduced by Gopalan et al. in 2012, and in
the same year Prakash et al. introduced the concept of codes with locality,
which are a type of locally recoverable codes. In this work we introduce a new
family of codes with locality, which are subcodes of a certain family of
evaluation codes. We determine the dimension of these codes, and also bounds
for the minimum distance. We present the true values of the minimum distance in
special cases, and also show that elements of this family are "optimal codes",
as defined by Prakash et al.
