pith. sign in

arxiv: 1509.00279 · v1 · pith:SFEXFND4new · submitted 2015-09-01 · 💻 cs.IT · cs.CC· cs.CR· math.IT

Information Sets of Multiplicity Codes

Daniel Augot (GRACE) , Fran\c{c}oise Levy-Dit-Vehel (ENSTA ParisTech UMA) , Man Cuong Ng\^o (GRACE) This is my paper
classification 💻 cs.IT cs.CCcs.CRmath.IT
keywords codesconstructionencodinggiveinformationkoppartymultiplicitysets
0
0 comments X
read the original 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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.