  In the paper "A new class of codes for Boolean masking of cryptographic
computations," Carlet, Gaborit, Kim, and Sol\'{e} defined a new class of rate
one-half binary codes called \emph{complementary information set} (or CIS)
codes. The authors then classified all CIS codes of length less than or equal
to 12. CIS codes have relations to classical Coding Theory as they are a
generalization of self-dual codes. As stated in the paper, CIS codes also have
important practical applications as they may improve the cost of masking
cryptographic algorithms against side channel attacks. In this paper, we give a
complete classification result for length 14 CIS codes using an equivalence
relation on $GL(n,\FF_2)$. We also give a new classification for all binary
$[16,8,3]$ and $[16,8,4]$ codes. We then complete the classification for length
16 CIS codes and give additional classifications for optimal CIS codes of
lengths 20 and 26.
