We consider the Mollard construction from the point of view of its efficiency for detecting multiple bit errors. We propose a generalization of the classical extended Mollard code to arbitrary code lengths. We show partial robustness of this construction: such codes have less undetected and miscorrected errors than linear codes. We prove that, for certain code parameters, the generalization of the Mollard construction can ensure better error protection than a generalization of Vasil’ev codes.

中文翻译：

---

莫拉德码作为鲁棒非线性码

我们从检测多位错误的效率的角度考虑Mollard结构。我们建议将经典扩展Mollard代码推广为任意代码长度。我们展示了这种结构的部分健壮性：与线性代码相比，此类代码具有更少的未被发现和错误纠正的错误。我们证明，对于某些代码参数，与Vasil'ev代码的泛化相比，Mollard构造的泛化可以确保更好的错误保护。