Skip to Main content Skip to Navigation
Conference papers

List decoding of a class of affine variety codes

Abstract : Consider a polynomial F in m variables and a fi nite point ensemble S = S1 X...X Sm. When given the leading monomial of F with respect to a lexicographic ordering we derive improved information on the possible number of zeros of F of multiplicity at least r from S. We then use this information to design a list decoding algorithm for a large class of affine variety codes.
Complete list of metadata

Cited literature [16 references]  Display  Hide  Download

https://hal.inria.fr/inria-00614246
Contributor : Marie Trape <>
Submitted on : Wednesday, August 10, 2011 - 11:46:59 AM
Last modification on : Tuesday, April 24, 2018 - 4:16:02 PM
Long-term archiving on: : Monday, November 12, 2012 - 3:16:18 PM

File

82.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : inria-00614246, version 1

Collections

Citation

Olav Geil, Casper Thomsen. List decoding of a class of affine variety codes. WCC 2011 - Workshop on coding and cryptography, Apr 2011, Paris, France. pp.263-272. ⟨inria-00614246⟩

Share

Metrics

Record views

122

Files downloads

177