  In this paper, we show some applications of algebraic curves to the
construction of kernels of polar codes over a discrete memoryless channel which
is symmetric w.r.t the field operations. We will also study the minimum
distance of the polar codes proposed, their duals and the exponents of the
matrices used for defining them. All the restrictions that we make to our
curves will be accomplished by the so-called Castle Curves.
