Skip to main navigation Skip to search Skip to main content

Information sets of Multiplicity codes

  • INRIA

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

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 Kopparty. 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.

Original languageEnglish
Title of host publicationProceedings - 2015 IEEE International Symposium on Information Theory, ISIT 2015
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages2401-2405
Number of pages5
ISBN (Electronic)9781467377041
DOIs
Publication statusPublished - 28 Sept 2015
EventIEEE International Symposium on Information Theory, ISIT 2015 - Hong Kong, Hong Kong
Duration: 14 Jun 201519 Jun 2015

Publication series

NameIEEE International Symposium on Information Theory - Proceedings
Volume2015-June
ISSN (Print)2157-8095

Conference

ConferenceIEEE International Symposium on Information Theory, ISIT 2015
Country/TerritoryHong Kong
CityHong Kong
Period14/06/1519/06/15

Keywords

  • Locally decodable codes
  • Multiplicity codes
  • Reed-Muller codes
  • information set
  • locally correctable codes

Fingerprint

Dive into the research topics of 'Information sets of Multiplicity codes'. Together they form a unique fingerprint.

Cite this