Information Sets of Multiplicity Codes
Information Theory
2015-09-02 v1 Computational Complexity
Cryptography and Security
math.IT
Abstract
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.
Cite
@article{arxiv.1509.00279,
title = {Information Sets of Multiplicity Codes},
author = {Daniel Augot and Françoise Levy-Dit-Vehel and Man Cuong Ngô},
journal= {arXiv preprint arXiv:1509.00279},
year = {2015}
}
Comments
International Symposium on Information Theory, Jun 2015, Hong-Kong, China. IEEE