A class of linear codes that extends classic Goppa codes to a non-commutative context is defined. An efficient decoding algorithm, based on the solution of a non-commutative key equation, is designed. We show how the parameters of these codes, when the alphabet is a finite field, may be adjusted to propose a McEliece-type cryptosystem.

翻译：定义了将经典的 Goppa 代码扩展至非混合背景的线性代码类别。 设计了一个基于非混合键方程式解决方案的高效解码算法。 我们展示了这些代码的参数, 当字母是一个限定字段时, 如何调整这些代码的参数, 以提出 McEliice- type 加密系统 。