Hermitian-Lifted Codes were first described in a paper by Lopez, Malmskog, Matthews, Piñero-Gonzales, and Wootters, which are advantageous for being locally recoverable and evaluated on a large set of functions. The paper proves that the rate of the code is bounded below by a positive constant for Hermitian Curve on $q=2^l$. This paper generalizes the theorem to show that the rate of Hermitian-Lifted Codes is bounded below by a positive constant when $q=p^l$ for any odd prime $p$.