We here provide a method for systematic encoding of the Multiplicity codes
introduced by Kopparty, Saraf and Yekhanin in 2011. The construction is built
on an idea of Kop-party. We properly define information sets for these codes
and give detailed proofs of the validity of Kopparty's construction, that use
generating functions. We also give a complexity estimate of the associated
encoding algorithm.Comment: International Symposium on Information Theory, Jun 2015, Hong-Kong,
China. IEE