Fast Jam-Proof Codes with the Possibility of Correction
摘要
Methods of constructing jamming-tolerant codes based on multi-position combinatorial configurations with a ring structure of the type of ideal ring-bundles are investigated to create coding systems that detect and correct errors, with improved quality indicators in terms of power and jamming. A general description of the method of building a multi-position jam-resistant code based on ideal ring- bundles, and methods of increasing the power of multi-position jam-resistant ideal ring- bundles codes is given. A comparative analysis of the parameters of the proposed code with the parameters of well-known codes was carried out. A study of the impact on the correction data was conducted depending on the number of errors and how many errors my program corrects. A method of simplified synthesis of an error-resistant multi-position code sequence based on ideal ring bundles has been developed, and an effective algorithm for encoding and decoding information has been created. The developed software application allows error-correcting coding correction based on ideal ring bundles (correction of up to 25% of the code length and detection of up to 50% of the code length).