计算二进制码的陪集首
Computing coset leaders of binary codes
摘要:
本文提出了一种计算二进制码$\mathcal C \subset \mathbb{F}_2^n$的所有陪集首集的算法。该方法是从一些相关的计算与代码相关的Gröbner表示的技术。该算法提供了一个Gröbner表示的二进制代码和陪集领导$\mathrm{CL}(\mathcal C)$的集合。它的效率表现在其复杂度与$\mathrm{CL}(\mathcal C)$的元素数成线性关系,比$\mathbb{F}_2^n$中的穷举搜索要小。
英文摘要:
We present an algorithm for computing the set of all coset leaders of a binary code $\mathcal C \subset \mathbb{F}_2^n$. The method is adapted from some of the techniques related to the computation of Gröbner representations associated with codes. The algorithm provides a Gröbner representation of the binary code and the set of coset leaders $\mathrm{CL}(\mathcal C)$. Its efficiency stands of the fact that its complexity is linear on the number of elements of $\mathrm{CL}(\mathcal C)$, which is smaller than exhaustive search in $\mathbb{F}_2^n$.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。