2011/01/26 by Olav Geil, Geil, Olav, Casper Thomsen +1
Computer Science · Engineering · Mathematics · #Cellular Automata and Applications #Coding theory and cryptography #FOS: Computer and information sciences #Information Theory (cs.IT) #cs.IT #graph theory and CDMA systems #math.IT
paper · pdf · doi:10.48550/arxiv.1101.4999
11 pages, 5 tables
arxiv created 2011/01/26 · openalex publication_date 2011/01/26 · arxiv updated 2011/01/27 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
Consider a polynomial F in m variables and a finite point ensemble S=S1 × ... × 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.