The Lee metric syndrome decoding problem is an NP-hard problem and several generic decoders have been proposed. The observation that such decoders come with a larger cost than their Hamming metric counterparts make the Lee metric a promising alternative for classical code-based cryptography. Unlike in the Hamming metric, an error vector that is chosen uniform at random of a given Lee weight is expected to have only few entries with large Lee weight. Using this expected distribution of entries, we are able to drastically decrease the cost of generic decoders in the Lee metric, by reducing the original problem to a smaller instance, whose solution lives in restricted balls.

翻译：李光学综合症解码问题是一个NP硬性的问题,一些通用解码器已经提出。认为这些解码器的成本高于其Hamming公尺对应方的成本,这使得李光学测量器成为传统基于代码的加密法的一个很有希望的替代物。 与Hamming测量器不同,根据给定的李重随机选择的误差矢量预计只有很少的条目,而李光学分解器的重量则很大。 使用这种预期的分解器,我们可以大幅降低李光学中通用解码器的成本,将最初的问题降低到一个较小的实例,而后者的解决方案是受限制的球。