Information Sets of Multiplicity Codes

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 metadatas

Cited literature [9 references]  Display  Hide  Download

https://hal.inria.fr/hal-01188935
Contributor : Daniel Augot <>
Submitted on : Monday, August 31, 2015 - 5:45:49 PM
Last modification on : Wednesday, July 3, 2019 - 10:48:05 AM
Long-term archiving on : Tuesday, December 1, 2015 - 10:47:20 AM

Files

ieee.pdf
Files produced by the author(s)

Identifiers

Citation

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⟩

Share

Metrics

Record views

405

Files downloads

287