We establish a property of finite maximal codes relating exponent $m$ such that $b^m$ is in the code for some letter $b$ to a structure pertaining to certain specific codewords. Consequently, we are able to propose some classes of finite codes that cannot be included in any finite maximal codes for almost all given exponents.