On decoding of a specific type of self-dual codes

TL;DR

This paper presents a new iterative decoding algorithm for a class of binary self-dual codes with specific automorphisms, demonstrating improved error correction capabilities beyond traditional bounds.

Contribution

It introduces a novel decoding method applicable to a broad class of self-dual codes with certain automorphisms, expanding decoding possibilities.

Findings

Error correction beyond the upper bound achieved

Decoding algorithm applicable to any self-dual code with the specific automorphism

Experimental results confirm the effectiveness of the new decoding scheme

Abstract

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.