EFFICIENT PERMUTATION DECODING OF BINARY BLOCK REDUNDANT CODES
The article describes a method of decoding of binary block redundant codes with the use of ordered statistics, which is implemented in the framework of permutation decoding (PD). Such algorithms are most effectively used in control systems in order to protect data against errors when sending them along the channels subjected to the influence of destructive factors. On the one hand, the advantage of permutation decoding is the possibility of processing of code vectors of the computed equivalent code outside the Hamming metric, which provides a significant energy code gain (ECG). On the other hand, the process of identifying the properties of rearranged matrix linearity of the equivalent code and bringing this matrix to the systematic form in case of confirmation of the properties of linearity, is a difficult task in the attitude of computation. The complexity of the computational process becomes exponential with increasing length of code vectors. In this context, the authors propose a new method for fast matrix transformations to allow normalizing the computational process of finding the matrix of the equivalent block code of virtually any length to polynomial complexity. The authors also introduce the concept of a decoder cognitive map. The probabilistic characteristics of the proposed decoders obtained by analytical modelling of communication channels with various streams of errors are given.