基于冒号理想的线性码的Error-correction
Error-correction of linear codes via colon ideals
摘要:
我们表明,通过线性码传输的数据中的错误可以被认为是新线性码的最小权重的码字。为了确定错误,我们可以使用特定于找到这种特殊码字的方法。其中一种方法是求某个齐次理想的饱和度的准素分解。当好的话(即具有唯一最近邻的向量)进行纠错,饱和的理想只是一个点的素理想(因此准素分解是多余的确定),我们表明,这个理想可以通过殖民原来的齐次理想与一定的变量的权力计算。然后,我们确定任何线性码的最小功率。
英文摘要:
We show that errors in data transmitted through linear codes can be thought of as codewords of minimum weight of new linear codes. To determine errors we can then use methods specific to finding such special codewords. One of these methods consists of finding the primary decomposition of the saturation of a certain homogeneous ideal. When good words (i.e. vectors with a unique nearest neighbor) are error-corrected, the saturated ideal is just the prime ideal of a point (so the primary decomposition is superfluously determined); we show that this ideal can be computed by coloning the original homogeneous ideal with a power of a certain variable. We then determine the smallest such power for any linear code.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。