Skip to Main content Skip to Navigation
New interface
Conference papers

Information Sets of Multiplicity Codes

Daniel Augot 1, * Françoise Levy-Dit-Vehel 2 Man Cuong Ngô 1 
* Corresponding author
1 GRACE - Geometry, arithmetic, algorithms, codes and encryption
LIX - Laboratoire d'informatique de l'École polytechnique [Palaiseau], Inria Saclay - Ile de France
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.
Complete list of metadata

Cited literature [9 references]  Display  Hide  Download
Contributor : Daniel Augot Connect in order to contact the contributor
Submitted on : Monday, August 31, 2015 - 5:45:49 PM
Last modification on : Wednesday, May 11, 2022 - 3:20:03 PM
Long-term archiving on: : Tuesday, December 1, 2015 - 10:47:20 AM


Files produced by the author(s)



Daniel Augot, Françoise Levy-Dit-Vehel, Man Cuong Ngô. Information Sets of Multiplicity Codes. Information Theory (ISIT), 2015 IEEE International Symposium on , Jun 2015, Hong-Kong, China. pp.2401 - 2405, ⟨10.1109/ISIT.2015.7282886⟩. ⟨hal-01188935⟩



Record views


Files downloads