  In this work codes with availability are constructed based on the cyclic
\emph{locally repairable code} (LRC) construction by Tamo et al. and their
extension to $(r,\rho)$-locality by Chen et al. The minimum distance of these
codes is increased by carefully extending their defining set. We give a bound
on the dimension of LRCs with availability and orthogonal repair sets and show
that the given construction is optimal for a range of parameters.
