  The neural rings and ideals as an algebraic tool for analyzing the intrinsic
structure of neural codes were introduced by C.~Curto et al. in 2013. Since
then they were investigated in several papers, including the 2017 paper by
G\"unt\"urk\"un et al., in which the notion of polarization of neural ideals
was introduced. In this paper we extend their ideas by introducing the notions
of polarization of motifs and neural codes. We show that the notions that we
introduced have very nice properties which could allow the studying of the
intrinsic structure of neural codes of length $n$ via the square free monomial
ideals in $2n$ variables and interpreting the results back in the original
neural code ambient space.
  In the last section of the paper we introduce the notions of inactive
neurons, partial neural codes, and partial motifs, as well as the notions of
polarization of these codes and motifs. We use these notions to give a new
proof of a theorem from the paper by G\"unt\"urk\"un et al. that we mentioned
above.
