Computing the minimum distances of linear codes by the error impulse method

Abstract

A new method for computing minimum distances is proposed and justified. Unlike classical techniques that rely on the exhaustive or partial enumeration of codewords with weights lower than or equal to the minimum distance, this new method is based on the ability of the soft-in decoder, when it exists, to overcome error impulse input patterns.