
























Multivariate multiplicity codes have been recently explored because of their importance for list decoding and local decoding. Given a multivariate multiplicity code, in this paper, we compute its dimension using Gröbner basis tools, its dual in terms of indicator functions, and explicitly describe a parity-check matrix. In contrast with Reed--Muller, Reed--Solomon, univariate multiplicity, and other evaluation codes, the dual of a multivariate multiplicity code is not equivalent or isometric to a multiplicity code (i.e., this code family is not closed under duality). We use our explicit description to provide a lower bound on the minimum distance for the dual of a multiplicity code.
此内容由惯性聚合(RSS阅读器)自动聚合整理,仅供阅读参考。 原文来自 — 版权归原作者所有。