Cycles in the Permutation Decoding System

Abstract

Currently, there is an increased interest in permutation decoding systems for systematic redundant codes due to the possibility of using cognitive methods for processing digital data. This allows you to give the decoding procedure of such codes a significant acceleration. The resulting time gain is in demand in many application areas. The gain is achieved by pre-calculating the generating matrix of the equivalent code, the structure of which is set by the current permutation of characters of the code vector. The result of this calculation is stored in the decoder's cognitive map. Due to this, the time required for organizing the search for equivalent code is replaced by the amount of memory on the cognitive map.