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.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.