Published in

2015 IEEE International Symposium on Information Theory (ISIT)

DOI: 10.1109/isit.2015.7282886

Links

Tools

Export citation

Search in Google Scholar

Information Sets of Multiplicity Codes

Journal article published in 2015 by Daniel Augot, Man Cuong Ngô ORCID, Françoise Levy-Dit-Vehel, Cuong M. Ngo
This paper is available in a repository.
This paper is available in a repository.

Full text: Download

Green circle
Preprint: archiving allowed
Upload
Green circle
Postprint: archiving allowed
Upload
Red circle
Published version: archiving forbidden
Policy details
Data provided by SHERPA/RoMEO

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. ; Comment: International Symposium on Information Theory, Jun 2015, Hong-Kong, China. IEEE