Algorithm for constructing binary linear block codes according to the given number of information symbols and the number of correctable errors

Abstract

The article presents an algorithm that constructs binary linear block codes according to the quantities of message and error correction bits. Theoretical complexity estimation and experimental time evaluation of the presented algorithm are proposed. It is shown that the algorithm provides codes with parameters equivalent to the results of algorithm exhaustive search. In most cases these parameters are the same as parameters of codes well-known from the literature (BCH, Golay), and in other cases they are inconsiderably worse.