This work introduces a decoding strategy for binary self-dual codes possessing an automorphism of a specific type. The proposed algorithm is a hard decision iterative decoding scheme. The enclosed experiments show that the new decoding concept performs error correction beyond the upper bound for the code correction capability. Moreover, we prove that the requirements for the new algorithm hold for any binary self-dual code having an automorphism of the specific type, which makes decoding of this large group of codes possible.

翻译：这项工作引入了一种二进制自我二进制代码的解码策略, 具有特定类型的自动形态。 提议的算法是一种硬决定迭代解码方案。 随附实验显示, 新的解码概念在代码校正能力上限以外进行错误校正。 此外, 我们证明, 任何二进制自我二进制代码对于特定类型的自动形态的要求, 使得能够解码这组大型代码。