Information Sets of Multiplicity Codes - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2015

Information Sets of Multiplicity Codes


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.
Fichier principal
Vignette du fichier
ieee.pdf (140.64 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01188935 , version 1 (31-08-2015)



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⟩
286 View
151 Download



Gmail Facebook X LinkedIn More