Підходи до побудови завадостійкого перестановочного коду для нероздільного факторіального кодування даних

Abstract

The report highlights approaches to construct error-correcting permutation code in the context of its use in integrated data protection systems against channel errors and unauthorized access based on nonseparable factorial coding. The use of affine and projective general linear groups to form an ensemble of permutations, in addition to providing a given code distance for permutation dictionaries (arrays), allows generating network and session keys during secure data exchange. The statistical approach to construct permutation code is based on enumerating permutations and selecting those permutations, which distance does not exceed a given value to all previously selected codewords.