Computer Science – Information Theory
Scientific paper
2011-01-26
Computer Science
Information Theory
11 pages, 5 tables
Scientific paper
Consider a polynomial $F$ in $m$ variables and a finite point ensemble $S=S_1 \times ... \times S_m$. 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.
Geil Olav
Thomsen Casper
No associations
LandOfFree
List decoding of a class of affine variety codes does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with List decoding of a class of affine variety codes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and List decoding of a class of affine variety codes will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-418547